steve_bank
Diabetic retinopathy and poor eyesight. Typos ...
I have been coding permutations and combinations.
P(n,r) = n!/(n-r)!
C(n,r) = n!/(r!* (n!-r!)
n! = 1*2*3...
0! = 1
For P it is obvious (n-r)! can never be greater than n!
For C I will test for the bounds. I have no idea how to start a proof that shows analytically if and when r!(n!-r!) is equal or greater than n!.
For the function I m writing max n is 33 for the size of n! and r <= n.
Any deas?
P(n,r) = n!/(n-r)!
C(n,r) = n!/(r!* (n!-r!)
n! = 1*2*3...
0! = 1
For P it is obvious (n-r)! can never be greater than n!
For C I will test for the bounds. I have no idea how to start a proof that shows analytically if and when r!(n!-r!) is equal or greater than n!.
For the function I m writing max n is 33 for the size of n! and r <= n.
Any deas?