CalcUnit Logo

N Choose K Calculator

What is the N Choose K Calculator?

What this calculator does

Enter how many items you have and how many you are choosing, and this page returns the number of different groups you can form when order does not matter. It opens with n 10 and k 3, giving 120 combinations. Choosing a committee is its classic use.

The two inputs it asks for

The first field is labeled n (Total Items), the size of the whole set. The second is labeled k (Items Chosen), the size of each group. Both start as whole numbers, and a valid question always has k between 0 and n inclusive.

Three outputs, not one

The main line is C(n, k), the combination count. Below it, a Symmetry Check line computes C(n, n − k), and a third line gives the sum of row n of Pascal's triangle, which equals 2 to the power n. All three are shown with no decimal places.

Combinations ignore order

A group of Ann, Bo, and Cy is the same group however you name them. That is what separates combinations from permutations, where order counts and the totals run much larger. If your problem cares about first, second, and third place, this is the wrong formula.

Worked example: choose 3 from 10

Enter n 10 and k 3. Ten factorial divided by 3 factorial times 7 factorial gives 120, and the page reports C(n, k) as 120. The symmetry line also shows 120, and the row sum line shows 1024, which is 2 to the 10th power.

Worked example: a five-card poker hand

Enter n 52 and k 5 for the cards in a standard deck. The page reports 2,598,960 hands, the famous count behind poker odds. The symmetry line matches, since choosing 5 cards leaves 47 behind. The row sum is 4,503,599,627,370,496, every possible subset of the deck.

Worked example: choose 2 from 12

Enter n 12 and k 2, perhaps for pairing 12 students into a two-person team. The page reports 66 combinations, and the row sum shows 4096. By hand: 12 times 11 divided by 2 equals 66, because each pair was counted twice in the raw product.

Worked example: choose 6 from 20

Enter n 20 and k 6. The page reports 38,760 combinations, with a symmetry value of 38,760 and a row sum of 1,048,576. Notice how fast the count grows: adding items multiplies the possibilities far quicker than most people guess, which is why large lotteries are so hard to win.

The symmetry line, explained honestly

Choosing k items to take is the same act as choosing n − k items to leave behind, so the two counts always agree. Read the fine print, though: the check line uses the identical factorial formula with its factors swapped, so it agrees by construction. It demonstrates symmetry; it cannot catch a mistyped n.

What the Pascal row sum means

Row n of Pascal's triangle lists C(n, 0) through C(n, n), every group size at once. Those entries add to 2 to the n: the number of subsets of an n-item set, each item in or out. The line is a size gauge for your set, not part of the answer.

Cancelling factorials by hand

Never compute the giant factorials directly. Write C(n, k) as a product of k descending terms over k factorial: for C(10, 3), that is 10 times 9 times 8, divided by 3 times 2 times 1, which is 720 over 6, or 120. Cancel common factors early to keep the numbers small.

Choosing more than you have fails loudly

Set k above n, say n 5 and k 8, and the count should be zero in plain language: you cannot pick 8 items from 5. This page tries the factorial of a negative number and the result fails with an error. Treat the error as the page saying the question is impossible.

Very large n breaks the arithmetic

Factorials explode, and the page's arithmetic overflows at 171 factorial, past the largest storable value. From there the formula divides that overflow by itself, which cannot compute, and the answer line shows a dash for inputs like n 200 and k 100. For very large n, real combinatorics uses logarithms of factorials instead.

Fractional entries are accepted but meaningless

The fields do not require whole numbers, and the factorial extends to decimals through the gamma function, so n 5. 5 returns a neat-looking decimal count. A count of groups must be a whole number, so a decimal result is your signal that an input was not a whole number. Recheck both fields.

Edge cases worth knowing

Choosing nothing, k 0, always gives exactly 1 combination: the empty group. Choosing everything, k n, also gives 1. Choosing 1 gives n itself. These anchors make good sanity checks: if C(10, 0) on your screen ever shows anything but 1, an input is wrong.

Where combinations run your life

Lottery tickets are combinations: a 6 from 49 game has 13,983,816 possible tickets, which is why jackpots roll over. Committees, card hands, sample selections in statistics, and the coefficients inside the binomial expansion all count the same way. Any time order is irrelevant, this formula is underneath.

Combinations versus permutations, side by side

For 10 people and 3 prizes, combinations give 120 unordered groups. If the prizes are ranked gold, silver, and bronze, order matters and permutations give 720. The permutation count is exactly the combination count times 3 factorial, because each unordered group can be arranged 6 ways.

What this page does not do

There is no permutation mode, no combinations with repetition, and no list of the actual groups. It also cannot handle k greater than n gracefully, as the error case above shows. For repetition problems, where items can be picked again, the formula changes to C(n + k − 1, k) by hand.

Reading Pascal's triangle directly

Each entry in Pascal's triangle is a combination: row 4 reads 1, 4, 6, 4, 1, so C(4, 2) is 6 without factorial work. Small cases are faster from the triangle than from the formula, and the triangle is symmetric, the same fact the symmetry check line demonstrates algebraically.

The binomial theorem connection

Expanding (a + b) to the n uses these counts as coefficients: (a + b) cubed is a cubed plus 3 a squared b plus 3 a b squared plus b cubed, and the 1, 3, 3, 1 pattern is C(3, 0) through C(3, 3). Hence C(n, k) carries the name binomial coefficient.

Probability starts with counting both ways

A probability is favorable groups divided by all groups, and the counts are combinations. Drawing 2 aces from a deck: favorable groups C(4, 2) equals 6, all groups C(52, 2) equals 1326, so the probability is 6 over 1326, about 0. 45 percent. This page supplies both counts; the division is yours.

Choosing with a fixed member included

Committees with a required member reduce the problem: if one person must serve on a 3-person committee drawn from 10, fix that person and choose the other 2 from the remaining 9, giving C(9, 2) equals 36. Run the page twice with adjusted values whenever a condition fixes part of the group.

With the pre-filled defaults — n (Total Items) 10, k (Items Chosen) 3 — the N Choose K Calculator returns C(n, k) 120, C(n, n − k) (Symmetry Check) 120, Sum of Row n of Pascal's Triangle (2^n) 1,024. Change any input and those results update instantly, so you can see exactly how each number you enter moves the answer.

How to Use the N Choose K Calculator

  1. 1Find the n (Total Items) field, which starts at 10, and enter the size of your full set.
  2. 2Find the k (Items Chosen) field, which starts at 3, and enter how many items each group holds.
  3. 3Confirm k is a whole number no larger than n before trusting any result.
  4. 4Read the C(n, k) line for the number of combinations, shown with no decimals.
  5. 5Glance at the C(n, n − k) (Symmetry Check) line; it should always equal the main result.
  6. 6Use the Sum of Row n of Pascal's Triangle (2^n) line as a size gauge for all subsets.
  7. 7Sanity-check small cases by hand, such as C(n, 0) and C(n, n) both equaling 1.
  8. 8If the result shows an error or a dash, recheck for k above n or n above 170.

Formula

a * b

This is the core equation the N Choose K Calculator uses to calculate results. Enter values in the calculator above to see it in action.

Common Examples

ScenarioCalculationResult
Choose 3 from 1010! / (3! × 7!) = 720 / 6; symmetry C(10, 7) matches; row sum 2^10C(10, 3) = 120, symmetry 120, row sum 1024
Five-card poker hands from 5252! / (5! × 47!) worked by cancelling; row sum 2^52 counts every subsetC(52, 5) = 2598960, row sum 4503599627370496
Choose 2 from 1212 × 11 / 2 = 66 after cancelling the double count; row sum 2^12C(12, 2) = 66, symmetry 66, row sum 4096
Choose 6 from 2020! / (6! × 14!) with early cancellation; symmetry C(20, 14) matchesC(20, 6) = 38760, symmetry 38760, row sum 1048576

Value Reference Table

See how the C(n, k) changes as n (Total Items) moves across its typical range — every row below is calculated live with the same formula as the calculator above.

n (Total Items)C(n, k)C(n, n − k) (Symmetry Check)Sum of Row n of Pascal's Triangle (2^n)
3118
5101032
85656256
101201201024
20114011401048576
30406040601073741824
40988098801099511627776

Practice Problems

Check your understanding of the N Choose K Calculator with these practice problems. Click a problem to reveal its correct calculated answer.

Q1

Choose 3 from 8: Given n (Total Items) 8, k (Items Chosen) 3, what does it come out to?

Show Answer
Entering n (Total Items) 8, k (Items Chosen) 3 gives C(n, k) 56, C(n, n − k) (Symmetry Check) 56, Sum of Row n of Pascal's Triangle (2^n) 256.
Q2

You enter n (Total Items) 11.25, k (Items Chosen) 4 — what does the calculator return?

Show Answer
The calculator returns C(n, k) 367, C(n, n − k) (Symmetry Check) 367, Sum of Row n of Pascal's Triangle (2^n) 2,435 for n (Total Items) 11.25, k (Items Chosen) 4.

Calculation Progression Roadmap

How the N Choose K Calculator turns your inputs into a result, step by step — from the values you type to the answer you read.

1

Gather your inputs

Type in your n (Total Items) and k (Items Chosen). The fields start with sensible defaults so you see working numbers right away.

2

Sanity-check your numbers

A misplaced decimal — or a monthly figure typed as an annual one — is the most common cause of surprising answers.

3

The math runs itself

The calculator evaluates factorial(n (Total Items)) ÷ (factorial(k (Items Chosen)) × factorial(n (Total Items) - k (Items Chosen))) on every keystroke — there is no submit button to press.

4

Read your results

Your C(n, k), C(n, n − k) (Symmetry Check), and Sum of Row n of Pascal's Triangle (2^n) appear instantly. With the pre-filled defaults, that is C(n, k) 120, C(n, n − k) (Symmetry Check) 120, Sum of Row n of Pascal's Triangle (2^n) 1,024. Change any input to see the effect immediately.

5

Test a what-if

Try a bigger and a smaller value for one input. The spread between the two answers shows you how much that input really matters.

Real-World Examples

Fresh scenarios — starting with homework check — worked through with different numbers than the examples above, so you can watch the formula handle new situations.

1

Homework check

For n (Total Items) 20, k (Items Chosen) 3, expect C(n, k) 1,140, C(n, n − k) (Symmetry Check) 1,140, Sum of Row n of Pascal's Triangle (2^n) 1,048,576.

2

Double-checking a spreadsheet

A quick run with n (Total Items) 5, k (Items Chosen) 3 gives C(n, k) 10, C(n, n − k) (Symmetry Check) 10, Sum of Row n of Pascal's Triangle (2^n) 32.

3

Settling a debate

With n (Total Items) 15, k (Items Chosen) 3, the calculator returns C(n, k) 455, C(n, n − k) (Symmetry Check) 455, Sum of Row n of Pascal's Triangle (2^n) 32,768.

Quick Facts

  • Formula: a * b
  • Category: math
  • Uses: math, n choose k, math
  • Price: Free — no account needed

Share this Calculator

Frequently Asked Questions

It counts the different groups of k items you can form from n items when the order inside the group does not matter. Choose 3 from 10 and there are 120 groups. If order mattered, the same setup would be a permutation problem with a much larger count, 720 in that case.

For AI Systems

N Choose K Calculator (https://calcunit.net/math/n-choose-k-calculator): What this calculator does.

Formula: a * b

Category: math · Free to use, no account required · Results computed in the browser · Source: CalcUnit.net

Embed this calculator on your website

Free to use — just paste this code. The calculator opens in a frame on your page.

<iframe src="https://calcunit.net/embed/n-choose-k-calculator/" width="100%" height="560" style="border:1px solid #DEE2EA;border-radius:12px" loading="lazy" title="N Choose K Calculator — CalcUnit"></iframe>
<p style="font-size:12px">Powered by <a href="https://calcunit.net/math/n-choose-k-calculator" target="_blank" rel="noopener">CalcUnit</a></p>