Combinations: Choosing Without Order
C(n,r) counts ways to choose r items from n when order does not matter. Same as binomial coefficient. CR(n,r) allows repetitionโstars and bars gives CR(n,r) = C(n+r-1,r).
Why This Mathematical Concept Matters
Why: Combinations answer: In how many ways can I choose r from n? Order does not matterโ{A,B} = {B,A}. Permutations count order; combinations do not.
How: C(n,r) = n!/(r!(n-r)!). For CR: imagine placing r stars in n bins (with dividers)โthat is C(n+r-1,r) arrangements.
- โPoker: C(52,5) = 2,598,960 possible hands.
- โC(n,r) = C(n,n-r)โchoosing r is same as excluding n-r.
- โStars and bars: r identical items into n distinct bins = CR(n,r).
๐ Examples โ Click to Load
Enter Values
โ ๏ธFor educational and informational purposes only. Verify with a qualified professional.
๐งฎ Fascinating Math Facts
C(52,5) = 2,598,960 possible poker hands.
C(n,r) = C(n,nโr) โ symmetry of binomial coefficients.
๐ Key Takeaways
- โข C(n,r) = n! / (r!(n-r)!) โ choose r from n, order doesn't matter
- โข CR(n,r) = C(n+r-1, r) โ combinations with replacement (multiset coefficient)
- โข C(n,0) = C(n,n) = 1; C(n,1) = n
- โข Symmetry: C(n,r) = C(n, n-r) โ use when r > n/2 for efficiency
- โข Pascal's identity: C(n,k) = C(n-1,k-1) + C(n-1,k)
๐ก Did You Know?
๐ How It Works
C(n,r) counts the number of ways to choose r items from n distinct items when order does not matter. The formula n!/(r!(n-r)!) divides the permutations P(n,r) = n!/(n-r)! by r! to remove the ordering of the r chosen items.
CR(n,r) counts multisets of size r from n types โ "stars and bars": placing r indistinguishable items into n bins. CR(n,r) = C(n+r-1, r).
๐ Worked Example: C(5,2)
Step 1: C(5,2) = 5! / (2! ร 3!)
Step 2: 5! = 120, 2! = 2, 3! = 6
Step 3: 120 / (2 ร 6) = 120 / 12 = 10
Interpretation: 10 ways to choose 2 items from 5 (e.g., {A,B}, {A,C}, โฆ)
๐ Real-World Applications
๐ Poker & Card Games
C(52,5) for 5-card hands; C(13,5) for flushes.
๐ฐ Lottery & Gambling
C(49,6) for picking 6 numbers from 49.
๐ฅ Committee Selection
C(10,3) ways to form a 3-person committee from 10.
๐ฆ Ice Cream Combos
CR(5,3) for 3 scoops from 5 flavors (repetition OK).
๐ฌ Experiment Design
Choosing treatment groups in clinical trials.
๐ Binomial Distribution
C(n,k) p^k (1-p)^(n-k) for k successes in n trials.
โ ๏ธ Common Mistakes to Avoid
- Confusing C and P: Use C when order doesn't matter; P when order matters. nPr = nCr ร r!
- Using C when CR applies: Ice cream scoops (repetition OK) need CR(n,r), not C(n,r).
- r > n for C(n,r): C(n,r) = 0 when r > n. Check your constraints.
- Forgetting symmetry: Use C(n,n-r) when r > n/2 to avoid overflow.
- Probability errors: Uniform random selection probability = 1/C(n,r).
๐ฏ Expert Tips
๐ก Use C(n,n-r)
When r > n/2, compute C(n,n-r) instead โ fewer multiplications, same result.
๐ก Probability = 1/C(n,r)
For uniform random selection of r from n, each combination has probability 1/C(n,r).
๐ก Stars and Bars
CR(n,r) = placing r items in n bins. Visualize r stars and (n-1) bars.
๐ก Verify with Pascal
Check: C(n,0)+C(n,1)+...+C(n,n) = 2^n.
๐ Reference Table
| Identity | Formula |
|---|---|
| C(n,r) | n! / (r!(n-r)!) |
| CR(n,r) | C(n+r-1, r) |
| Symmetry | C(n,r) = C(n, n-r) |
| Pascal | C(n,k) = C(n-1,k-1) + C(n-1,k) |
| Row sum | ฮฃ C(n,r) = 2^n |
| Relation to P | P(n,r) = C(n,r) ร r! |
๐ Quick Reference
๐ Practice Problems
โ FAQ
C vs CR โ when to use which?
C(n,r): no repetition, order doesn't matter (e.g., committee, poker hand). CR(n,r): repetition allowed, order doesn't matter (e.g., ice cream scoops).
When is C(n,r) largest?
When r โ n/2. For even n, C(n,n/2) is the maximum. For odd n, C(n,โn/2โ) and C(n,โn/2โ) are equal and largest.
How many poker hands?
C(52,5) = 2,598,960 possible 5-card hands from a standard deck.
Why CR(n,r) = C(n+r-1, r)?
Stars and bars: placing r indistinguishable items into n distinct bins. Equivalent to choosing r positions from n+r-1 slots.
Probability of uniform selection?
When choosing r from n without replacement uniformly at random, each combination has probability 1/C(n,r).
Combinations vs permutations?
Combinations: order doesn't matter. Permutations: order matters. P(n,r) = C(n,r) ร r!.
Can r exceed n for CR?
Yes. CR(n,r) allows r > n. For example, CR(5,10) = C(14,10) = 1001 ways to get 10 scoops from 5 flavors.
๐ Summary
C(n,r) counts ways to choose r items from n when order doesn't matter. CR(n,r) counts multisets of size r from n types (repetition allowed). Use C for committees, poker hands, lottery; CR for ice cream scoops, distributing identical items. Pascal's identity and symmetry C(n,r)=C(n,n-r) simplify calculations.
โ Verification Tip
Verify: C(n,0)+C(n,1)+...+C(n,n) = 2^n. For CR, check CR(n,1)=n and CR(n,0)=1. Use Pascal's triangle for small n.
๐ Next Steps
Explore the Permutation Calculator for ordered arrangements, the Binomial Coefficient Calculator for Pascal's triangle and expansions, or the Combinations with Replacement Calculator for full C/CR/P/PR comparison.
โ ๏ธ Disclaimer: For very large n+r, overflow may occur. Results for educational use. Verify critical calculations independently.