C N K Calculator
Use this premium combination calculator to evaluate C(n, k), also written as n choose k. Enter the total number of items and how many you want to select, then instantly compute the exact number of unique combinations, view a chart, and understand what the result means in practical probability and counting problems.
Expert Guide to Using a C N K Calculator
A c n k calculator is a tool for solving one of the most important counting formulas in mathematics, probability, statistics, computer science, and data analysis. The notation C(n, k) means “the number of ways to choose k items from n total items when order does not matter.” You may also see the same expression written as n choose k, binomial coefficient, or combinations.
At a practical level, this idea appears everywhere. If a committee chooses 4 members from 12 candidates, if a card player is dealt 5 cards from a 52-card deck, if a researcher selects test samples from a larger population, or if a lottery ticket requires choosing a set of numbers without regard to order, the underlying count is a combination. This calculator makes that count immediate and accurate.
What C(n, k) actually means
Suppose you have 10 distinct objects and want to select 3 of them. If you care only about which 3 are chosen, the count is C(10, 3) = 120. The selection {A, B, C} is identical to {C, B, A}. Because order does not change the chosen group, combinations are smaller than permutations.
The exact formula is:
C(n, k) = n! / (k!(n-k)!)
Here, n! means factorial, the product of all positive integers from 1 to n. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. The denominator removes overcounting caused by different orders of the same chosen set.
How to use this calculator correctly
- Enter the total number of available items as n.
- Enter how many items are selected as k.
- Choose how you want the result displayed: exact integer, scientific notation, or both.
- Select a chart view. The profile chart is useful for seeing how combination counts change across different values of r.
- Click Calculate C(n, k) to see the exact count and a visual interpretation.
The calculator also validates the most important rule: k cannot be greater than n. You cannot choose 8 items from a set of 5 if no repetition is allowed.
When you should use combinations instead of permutations
This is one of the most common points of confusion. Use a combination when order does not matter. Use a permutation when order matters.
- Combination example: selecting 6 finalists from 30 applicants.
- Permutation example: awarding gold, silver, and bronze medals to 3 of 30 finalists.
In the finalist example, the group {A, B, C, D, E, F} is the same regardless of listing order. In the medals example, putting A in gold and B in silver is different from putting B in gold and A in silver.
Why C(n, k) matters in probability
Combination counts are deeply connected to probability because many random experiments depend on counting equally likely outcomes. If you want the probability of a specific hand in cards, a specific basket of chosen products, or a specific lottery result, you often divide the number of favorable combinations by the total number of possible combinations.
For instance, the number of distinct 5-card hands from a standard 52-card deck is:
C(52, 5) = 2,598,960
That means any one exact 5-card combination, assuming fair dealing, has probability 1 / 2,598,960. This is why poker and other card games are naturally described using combinations.
Real-world comparison table: lottery games and combination counts
Lotteries provide one of the clearest real-world examples of combinations. The total odds of hitting the jackpot are usually based on how many unique number sets can be formed under the game’s rules.
| Game | Combination structure | Total possible outcomes | Approximate jackpot odds |
|---|---|---|---|
| Powerball | C(69, 5) × 26 | 292,201,338 | 1 in 292,201,338 |
| Mega Millions | C(70, 5) × 25 | 302,575,350 | 1 in 302,575,350 |
| 5-card poker hand | C(52, 5) | 2,598,960 | 1 in 2,598,960 for one exact hand |
These numbers are not abstract curiosities. They help explain why jackpot events are so rare and why many probability systems are counterintuitive to people who do not work with combinatorics regularly.
Common exact values every student and analyst should know
Many standard exercises and applied problems use a recurring set of combination counts. Knowing these values helps you sense whether an answer is in the right range.
| Expression | Exact value | Typical application |
|---|---|---|
| C(10, 2) | 45 | Pairwise comparisons among 10 items |
| C(10, 3) | 120 | Small team or committee selection |
| C(20, 5) | 15,504 | Mid-sized sample selection problems |
| C(30, 6) | 593,775 | Scheduling, staffing, and contest selection |
| C(52, 5) | 2,598,960 | 5-card poker hands |
| C(100, 10) | 17,310,309,456,440 | Large dataset feature selection and sampling |
Understanding the shape of combination growth
One reason this calculator includes a chart is that combination values do not grow linearly. For a fixed n, the values of C(n, r) start small at r = 0, rise toward the middle, and then decline symmetrically. This pattern is fundamental to Pascal’s Triangle and the binomial distribution.
For example, when n = 10, the sequence is:
1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 1
The largest values occur near the center. In many applications, this explains why “middle-sized selections” can generate enormously more possible combinations than very small or very large selections. If you are selecting just 1 item from 100, there are only 100 choices. If you are selecting 50 from 100, the count becomes astronomically larger.
Use cases in statistics, science, and computing
- Statistics: hypergeometric probability, sampling without replacement, contingency analysis.
- Machine learning: feature subset selection, search-space estimation, model complexity planning.
- Operations research: team formation, routing options, subset optimization.
- Biology and chemistry: combinations of markers, treatment subsets, gene panels, and trial arms.
- Cybersecurity: key-space and policy combination counting in restricted-selection systems.
- Finance: portfolio basket construction and stress-testing subsets of holdings.
Typical mistakes people make
- Using permutations when combinations are needed. If order does not matter, use C(n, k).
- Entering k larger than n. This is invalid for standard combinations without repetition.
- Ignoring symmetry. Since C(n, k) = C(n, n-k), calculations can often be simplified.
- Underestimating growth. Combination counts become huge very quickly, even for moderate inputs.
- Misreading probability. A large count of possible outcomes usually means a small chance of one specific outcome.
Why exact arithmetic matters
For larger values of n and k, combination counts can exceed normal floating-point precision. That is why serious calculators should use exact integer arithmetic whenever possible. If you rely only on rough decimals, you can lose critical accuracy in probability analysis, especially when comparing very large but close counts.
This page computes the exact integer for valid inputs and also offers scientific notation when the full number becomes long. That gives you both precision and readability.
Relationship to Pascal’s Triangle and the binomial theorem
The values of C(n, k) are the entries in Pascal’s Triangle. Each entry is the sum of the two directly above it. These same numbers are also the coefficients in the expansion of (a + b)^n. For example:
(a + b)^5 = a^5 + 5a^4b + 10a^3b^2 + 10a^2b^3 + 5ab^4 + b^5
The coefficients 1, 5, 10, 10, 5, 1 are exactly the combination values for n = 5. This is one reason combinatorics is central not only to counting problems, but also to algebra and probability distributions.
Authoritative references for deeper study
If you want formal background beyond this calculator, these sources are excellent starting points:
- Penn State STAT 414 probability resources
- NIST Engineering Statistics Handbook
- UC Berkeley statistics resources
Final takeaway
A c n k calculator is much more than a classroom aid. It is a practical decision-support tool for any problem involving selection without order. Whether you are estimating lottery odds, counting card hands, evaluating experiment designs, or measuring the size of a search space in computing, the combination formula tells you how many distinct subsets are possible.
Use this calculator when you need fast, exact, and visually interpretable results. Enter your values, check the output, and use the chart to understand how your chosen k compares with the full pattern of C(n, r) values across the same n. That combination of exact arithmetic and visual context is what turns a raw formula into a tool you can actually use.
Educational note: This calculator assumes combinations without repetition. If your problem allows repeated selections, a different counting formula is required.