Definition: The number of different possible ways we can pick a number elements for combinations with repetition we use a different formula.
c(n, p) = (n + p - 1)! / (n - 1)!p!
We use combinations with repetition when the events we are dealing with have sufficient quantity if each of the distinct values in the sample space.
ex1. Toppings on pizza
ex2. Picking BaskinRobbin's icecream flavour or the players for the EPL 11.
Example:
You can have 3 same topping, 3 different toppings, or double of one topping and another topping.
Use 0s and 1s to show what toppings you want (6 zeroes & 3 ones)
A pizza with cheese & extra pepperoni:
C O G M P B
1,0 0 0 0 1,1,0 0
Only the first 8 elements can take a value of 1
The number of different pizzas would be the combination of any 3 of the 8 positions.
Therefore, the number of pizzas we can get would the number of combinations of picking 3 elements out of a set of 8.
C(6, 3)"combinations with repetition" = C(8, 3)"combinations without repetition"
3 represents the amount of toppings we need to pick = p
8 represents the number of positions we have for the ones
6 + 3 = 9 positions but the last element is always a 0
which makes (n + p - 1)