N Combination R. However for our original question we had n 3 and r 3. So we can substitute r n 1 as n.
However for our original question we had n 3 and r 3. Also referred to as r combination or n choose r or the binomial coefficient. The number of k combinations for all k is the number of subsets of a set of n elements.
We need to make n 5.
To use values of n above about 45 you will need to increase r s recursion limit. You have won first place in a contest and are allowed to choose 2 prizes from a table. For our example of 3 scoops of ice cream from 3 tubs the number of combinations with repetition is. N factorial notation then have a look the factorial lesson.