I am a bit stuck on this problem. How do I find the minimum number of elements n which ensure that I have at least C combinations of order r ? Basically, for a given C and r, find the minimum n which satisfies:
$\frac{n!}{r!(n-r)!} \ge C$
I am a bit stuck on this problem. How do I find the minimum number of elements n which ensure that I have at least C combinations of order r ? Basically, for a given C and r, find the minimum n which satisfies:
$\frac{n!}{r!(n-r)!} \ge C$
Copyright © 2021 JogjaFile Inc.