Dgdrxrt

Integer addition + constant, is it a group?

Is oxalic acid dihydrate considered a primary acid standard in analytical chemistry?

Was Spock the First Vulcan in Starfleet?

You cannot touch me, but I can touch you, who am I?

Trouble understanding the speech of overseas colleagues

How did Arya survive the stabbing?

Large drywall patch supports

How to safely derail a train during transit?

Failed to fetch jessie backports repository

Method to test if a number is a perfect power?

Pole-zeros of a real-valued causal FIR system

Is a stroke of luck acceptable after a series of unfavorable events?

Do the temporary hit points from the Battlerager barbarian's Reckless Abandon stack if I make multiple attacks on my turn?

Crossing the line between justified force and brutality

How do I find the solutions of the following equation?

How does the UK government determine the size of a mandate?

Would a high gravity rocky planet be guaranteed to have an atmosphere?

Gears on left are inverse to gears on right?

How do scammers retract money, while you can’t?

How do I extract a value from a time formatted value in excel?

How do I go from 300 unfinished/half written blog posts, to published posts?

Avoiding estate tax by giving multiple gifts

Why Were Madagascar and New Zealand Discovered So Late?

How to be diplomatic in refusing to write code that breaches the privacy of our users

Inverse/Reverse of Number of Permutations and of Number of Combinations with Repetitions?

How to reverse the $n$ choose $k$ formula?Permutations with Repetitions, how to select $n$ and $r$How many possible combinations/permutations?Trouble with permutations and combinations problemsCombinatorics: terminology for permutations and combinationsTerminology clarification: are these permutations or combinations?Finding $n$ permutations $r$ with repetitionsCombinations and Permutations artistHow can we count combinations with repetition (or permutations) using inequality symbols between each number?Visualizing combinations with repetitions allowed.Using the numbers 1, 2, 3, 4 and 5, how many 3-digit combinations can you make? Repetitions allowed.

0

$begingroup$

For an engineering application, I need the inverse functions of the computations of the number of combinations and permutations.

In the thread How to reverse the $n$ choose $k$ formula? it shows how to reverse/inverse the number of combinations function...

Given:

$X = C(n, k) = binomnk = fracn! k!(n-k)! $

then you can limit n to:

$sqrt[k]k! X + k ge n ge sqrt[k]k! X$

And thus you at most need to check k+1 possible values of n.
Great!

But how do I solve for k instead of for n?

And given instead:

$X = P(n, k) = fracn! (n-k)! $

then would I be correct in assuming from above that:

$sqrt[k]X + k ge n ge sqrt[k]X$

? And if so, how would I then solve for k instead of n?

And finally, given instead CR is Combinations with Repetitions:

$X = CR(n, k) = binomn+k-1k = binomn+k-1n-1 = frac (n+k-1)! k!(n-1)! $

then would I be correct in assuming from above that:

$sqrt[k]k! X + 1 ge n ge sqrt[k]k! X - k + 1$

? And if so, how would I then solve for k instead of n?

Any help on the algebra for these five related inverse functions would be greatly appreciated!

combinatorics permutations combinations binomial-coefficients inverse-function

share|cite|improve this question

asked 20 hours ago

Brian KennedyBrian Kennedy

1062

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Question: when we are solving for $k$, is $n$ fixed?
  $endgroup$
  – Eevee Trainer
  19 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Yes, @Eevee Trainer, when solving for k, you can assume n is fixed/known.
  $endgroup$
  – Brian Kennedy
  11 hours ago
  
  

  
  
  
  

add a comment | 

0

$begingroup$

For an engineering application, I need the inverse functions of the computations of the number of combinations and permutations.

In the thread How to reverse the $n$ choose $k$ formula? it shows how to reverse/inverse the number of combinations function...

Given:

$X = C(n, k) = binomnk = fracn! k!(n-k)! $

then you can limit n to:

$sqrt[k]k! X + k ge n ge sqrt[k]k! X$

And thus you at most need to check k+1 possible values of n.
Great!

But how do I solve for k instead of for n?

And given instead:

$X = P(n, k) = fracn! (n-k)! $

then would I be correct in assuming from above that:

$sqrt[k]X + k ge n ge sqrt[k]X$

? And if so, how would I then solve for k instead of n?

And finally, given instead CR is Combinations with Repetitions:

$X = CR(n, k) = binomn+k-1k = binomn+k-1n-1 = frac (n+k-1)! k!(n-1)! $

then would I be correct in assuming from above that:

$sqrt[k]k! X + 1 ge n ge sqrt[k]k! X - k + 1$

? And if so, how would I then solve for k instead of n?

Any help on the algebra for these five related inverse functions would be greatly appreciated!

combinatorics permutations combinations binomial-coefficients inverse-function

share|cite|improve this question

asked 20 hours ago

Brian KennedyBrian Kennedy

1062

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Question: when we are solving for $k$, is $n$ fixed?
  $endgroup$
  – Eevee Trainer
  19 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Yes, @Eevee Trainer, when solving for k, you can assume n is fixed/known.
  $endgroup$
  – Brian Kennedy
  11 hours ago
  
  

  
  
  
  

add a comment | 

$begingroup$

For an engineering application, I need the inverse functions of the computations of the number of combinations and permutations.

In the thread How to reverse the $n$ choose $k$ formula? it shows how to reverse/inverse the number of combinations function...

Given:

$X = C(n, k) = binomnk = fracn! k!(n-k)! $

then you can limit n to:

$sqrt[k]k! X + k ge n ge sqrt[k]k! X$

And thus you at most need to check k+1 possible values of n.
Great!

But how do I solve for k instead of for n?

And given instead:

$X = P(n, k) = fracn! (n-k)! $

then would I be correct in assuming from above that:

$sqrt[k]X + k ge n ge sqrt[k]X$

? And if so, how would I then solve for k instead of n?

And finally, given instead CR is Combinations with Repetitions:

$X = CR(n, k) = binomn+k-1k = binomn+k-1n-1 = frac (n+k-1)! k!(n-1)! $

then would I be correct in assuming from above that:

$sqrt[k]k! X + 1 ge n ge sqrt[k]k! X - k + 1$

? And if so, how would I then solve for k instead of n?

Any help on the algebra for these five related inverse functions would be greatly appreciated!

combinatorics permutations combinations binomial-coefficients inverse-function

share|cite|improve this question

asked 20 hours ago

Brian KennedyBrian Kennedy

1062

$endgroup$

share|cite|improve this question

asked 20 hours ago

Brian KennedyBrian Kennedy

1062

share|cite|improve this question

asked 20 hours ago

Brian KennedyBrian Kennedy

1062

asked 20 hours ago

Brian KennedyBrian Kennedy

1062

asked 20 hours ago

Brian KennedyBrian Kennedy

1062