Binomial Coefficients
C(n,k) counts the number of ways to choose k items from n, order irrelevant. These coefficients appear in Pascal's triangle, the binomial theorem, and probability. Essential for lottery odds, committee selection, and combinatorics.
Did our AI summary help? Let us know.
Pascal's triangle: each entry is the sum of the two above. Binomial theorem: (x+y)ⁿ = Σ C(n,k) xⁿ⁻ᵏ yᵏ. Use k≤n/2 for efficiency: C(n,k)=C(n,n−k).
Ready to run the numbers?
Why: Binomial coefficients count combinations: lottery picks, poker hands, committee formation, DNA sequences. They are the building blocks of the binomial theorem (x+y)ⁿ.
How: Use C(n,k)=n!/(k!(n−k)!) for small n. For large n, use the multiplicative formula to avoid factorial overflow. Pascal's identity C(n,k)=C(n−1,k−1)+C(n−1,k) builds the triangle.
Run the calculator when you are ready.
Real-World Scenarios — Click to Load
Pascal Row C(5,0)..C(5,5)
k vs n−k
Calculation Steps
For educational and informational purposes only. Verify with a qualified professional.
🧮 Fascinating Math Facts
C(52,5)=2,598,960 possible poker hands.
— Poker
Row n of Pascal's triangle sums to 2ⁿ.
— Binary
Key Takeaways
- C(n,k) = n! / (k!(n−k)!) — number of ways to choose k items from n, order doesn't matter.
- Symmetry: C(n,k) = C(n,n−k). Use k ≤ n/2 for efficiency.
- Pascal's identity: C(n,k) = C(n−1,k−1) + C(n−1,k). Each row sums to 2ⁿ.
- Binomial theorem: (x+y)ⁿ = Σ C(n,k) xⁿ⁻ᵏ yᵏ. Coefficients are C(n,k).
- Applications: Lottery, committees, poker hands, DNA, binary strings, probability.
Did You Know?
How It Works
The binomial coefficient C(n,k) counts combinations: ways to choose k items from n, order irrelevant. Formula: C(n,k) = n! / (k!(n−k)!). For large n, use the multiplicative formula to avoid overflow: C(n,k) = (n/1)·((n−1)/2)·...·((n−k+1)/k). Pascal's triangle builds row by row: each entry is the sum of the two above. The binomial theorem expands (x+y)ⁿ using these coefficients.
Expert Tips
Use symmetry
C(n,k) = C(n,n−k). For k > n/2, compute C(n,n−k) instead.
Pascal for small n
For n ≤ 15, Pascal's triangle is fast and visual.
Multiplicative for large n
For n > 20, avoid factorial overflow. Use iterative formula.
Check bounds
C(n,k) = 0 if k < 0 or k > n. C(n,0) = C(n,n) = 1.
Reference Table — Pascal's Triangle
| n | Row 0..n | Sum |
|---|---|---|
| 0 | 1 | 1 |
| 1 | 1, 1 | 2 |
| 2 | 1, 2, 1 | 4 |
| 3 | 1, 3, 3, 1 | 8 |
| 4 | 1, 4, 6, 4, 1 | 16 |
| 5 | 1, 5, 10, 10, 5, 1 | 32 |
| 6 | 1, 6, 15, 20, 15, 6, 1 | 64 |
Frequently Asked Questions
What is n choose k?
C(n,k) = number of ways to choose k items from n, order doesn't matter. Also written ⁿCₖ or (n k).
Why is C(n,0) = 1?
There is exactly one way to choose nothing: the empty set.
What is Pascal's triangle?
A triangular array where each number is the sum of the two above. Row n contains C(n,0), C(n,1), ..., C(n,n).
How does the binomial theorem use this?
(x+y)ⁿ = Σ C(n,k) xⁿ⁻ᵏ yᵏ. The coefficients are the binomial coefficients.
Why use multiplicative formula for large n?
n! overflows for n > 20. The iterative formula C(n,k) = (n/1)·((n−1)/2)·... avoids overflow.
What about multinomial coefficients?
C(n; k₁,k₂,...,kₘ) = n!/(k₁!k₂!...kₘ!) when k₁+...+kₘ=n. Generalizes binomial.
Quick Reference Numbers
Disclaimer: For n > 100, JavaScript number precision may limit accuracy. Use exact integer libraries for very large values.
Related Calculators
Power Set Calculator
Generate the power set P(S) of any set S — all possible subsets including the empty set. Calculate |P(S)| = 2^n, proper subsets (2^n − 1), and k-element subsets C(n,k). Input set elements comma-separated; optional k for k-subsets. Bar chart of subsets by size (0-element, 1-element, etc.), Doughnut showing size distribution. Examples: {a,b,c}, {1,2,3,4}, empty set ∅, single element {x}, binary representation, team selection. Educational content on power set definition, relationship to binary numbers, Cantor's theorem, applications in combinatorics, logic, and computer science.
MathematicsAbsolute Value Equation Calculator
Solve absolute value equations and inequalities including |ax+b|=c, |ax+b|=|cx+d|, and |ax+b|≤c forms. Features solution verification, number line...
MathematicsAbsolute Value Inequalities Calculator
Solve absolute value inequalities |ax+b| < c, > c, ≤ c, ≥ c. Get solution intervals, interval notation, set builder notation, number line visualization...
MathematicsBessel Function Calculator
Calculate Bessel functions J_n(x), Y_n(x), I_n(x), and K_n(x) with series approximation. Supports first kind (J), second kind/Neumann (Y), and modified Bessel functions (I, K). Applications include vibrating drum modes, electromagnetic waveguides, heat conduction in cylinders, and Bessel filter design in signal processing. Uses the power series J_n(x) = Σ (-1)^m/(m!(m+n)!)·(x/2)^(2m+n). Includes convergence info, Bar chart comparing values at different x, Doughnut chart showing series term contributions, and educational content on Bessel's differential equation and cylindrical harmonics.
MathematicsBox Method Calculator
Multiply polynomials visually using the box method (area model). Step-by-step solutions for binomials, trinomials, and factoring. Interactive grid...
MathematicsCompleting the Square Calculator
Convert quadratic expressions from standard form ax²+bx+c to vertex form a(x-h)²+k. Find vertex, axis of symmetry, x-intercepts, and min/max values....
Mathematics