C(n, k)
—
Pascal’s row n
—
Step by step
Calculate the binomial coefficient C(n, k) — “n choose k” — exactly, with the matching row of Pascal’s triangle.
Step by step
Enter n and k with 0 ≤ k ≤ n.
n is the total number of items; k is how many you choose. Both are whole numbers with k no larger than n.
The binomial coefficient counts the ways to choose k items from n without regard to order.
Row n of Pascal’s triangle lists every C(n, 0) … C(n, n) — the coefficients of (a + b)ⁿ.