N Choose R Calculator

How many different 5-card poker hands can be dealt from a 52-card deck? How many ways can 6 lottery numbers be drawn from 49? These are questions about combinations — choosing r items from n without caring about the order — and the numbers involved get astronomically large far faster than intuition suggests. The N Choose R Calculator computes combinations C(n, r) and permutations P(n, r) exactly, using precision arithmetic that handles enormous results without rounding errors.

Combinatorics sits underneath probability, statistics, game design, cryptography, and genetics. Whether you are a student checking homework, a poker player calculating hand odds, or a data scientist sizing up a sample space, this tool gives you the exact count in seconds. It also shows the probability of any single specific combination, turning abstract factorials into a number you can feel.

Combinations vs. Permutations: The Key Distinction

A combination counts selections where order does not matter. The poker hand A♠ K♥ Q♦ J♣ 10♠ is the same hand no matter what order the cards arrive in — so poker hands are combinations, computed as C(52, 5) = 2,598,960. A permutation counts selections where order matters. A safe combination of 3-17-42 is different from 42-3-17, so lock codes are permutations.

The formulas reflect this. Combinations: C(n, r) = n! / (r! × (n − r)!). Permutations: P(n, r) = n! / (n − r)!. Because permutations treat every ordering as distinct, P(n, r) is always larger than C(n, r) — exactly r! times larger, since that is how many ways r items can be ordered. For the poker example, P(52, 5) = 311,875,200, which is 120 times C(52, 5), because 5! = 120.

Why You Cannot Just Use Factorials Directly

The textbook formulas involve factorials, but factorials explode violently. Just 21! already exceeds the largest integer a standard 64-bit number can hold exactly, and 171! overflows even double-precision floating point into infinity. A naive calculator that computes n! first will crash or return garbage for modest inputs like n = 100.

This calculator avoids the trap entirely. It computes combinations with the multiplicative formula — multiplying and dividing step by step so intermediate values stay small — and uses exact integer arithmetic throughout, so C(100, 50) comes out as precisely 100,891,344,545,564,193,334,812,497,256 rather than a rounded approximation. No scientific notation, no floating-point drift: the exact integer, every digit correct.

How to Use the N Choose R Calculator

Enter n, the total number of items to choose from, and r, how many you are choosing. The rules are simple: both must be whole numbers, neither can be negative, and r cannot exceed n. Values of n up to 1000 are supported — far beyond what any textbook problem requires.

Press Calculate and four labeled rows appear: the exact number of combinations C(n, r), the exact number of permutations P(n, r), the combinations figure with thousand separators for readability, and the probability of one specific combination expressed as "1 in N." Press Reset to try new values.

Worked Example 1: Poker Hands — C(52, 5)

A standard deck has 52 cards, and a poker hand uses 5. Order does not matter, so this is a combinations problem. Here is the computation step by step.

Step 1: Set up the multiplicative formula. Since r = 5 is smaller than n − r = 47, compute with 5 steps: (52 × 51 × 50 × 49 × 48) / (5 × 4 × 3 × 2 × 1).

Step 2: Evaluate. The numerator is 311,875,200 and the denominator is 120. Dividing gives 2,598,960 combinations.

Step 3: Compute permutations for comparison. P(52, 5) skips the division by 5!, giving 311,875,200 — every possible ordered deal of 5 cards.

Step 4: Find the probability of one specific hand. Being dealt the exact royal flush in spades is 1 chance in 2,598,960. There are 4 royal flushes (one per suit), so the probability of any royal flush is 4 in 2,598,960, or about 1 in 649,740.

This single number explains why poker strategy works: with nearly 2.6 million possible hands, the ranking of hand strengths is a direct consequence of combinatorics, not opinion.

Worked Example 2: Lottery Odds — C(49, 6)

A classic lottery draws 6 numbers from 49. Order does not matter, so the jackpot odds are C(49, 6).

Step 1: Set up the formula. (49 × 48 × 47 × 46 × 45 × 44) / (6 × 5 × 4 × 3 × 2 × 1).

Step 2: Evaluate. The numerator is 10,068,347,520 and the denominator is 720, giving 13,983,816 combinations.

Step 3: State the jackpot probability. A single ticket wins the jackpot with probability 1 in 13,983,816 — about 0.00000715 percent.

Step 4: Compare with permutations. If the draw order mattered, there would be 10,068,347,520 possible outcomes — 720 times more. Lotteries deliberately ignore order, which is the only reason the odds are merely astronomical instead of incomprehensible.

To feel how large 13,983,816 is: if you bought one ticket per second, you would need over 161 days of nonstop buying to cover every combination.

Everyday Situations Governed by N Choose R

Combinations quietly run enormous parts of daily life. Committee selection — choosing 3 people from a 12-person team — is C(12, 3) = 220 possible committees. Fantasy sports lineups, password strength estimates, and quality-control sampling (testing 5 items from a batch of 200) all reduce to n-choose-r counts.

In genetics, the number of ways to inherit gene variants follows combinatorics. In computer science, network routing options and encryption key spaces are combinatorial counts — a 128-bit key has 2^128 possibilities, a number with 39 digits. In statistics, the binomial distribution's core term is literally C(n, r): the probability of exactly r successes in n trials is C(n, r) × p^r × (1−p)^(n−r). Master n-choose-r and a huge swath of applied math opens up.

Pascal's Triangle and the Beauty of the Pattern

Arrange all values of C(n, r) in a triangle with n as the row and r as the position, and you get Pascal's triangle: each number is the sum of the two above it, because C(n, r) = C(n−1, r−1) + C(n−1, r). Row 5 reads 1, 5, 10, 10, 5, 1 — the counts for choosing 0 through 5 items from 5.

The triangle reveals deep structure. Its rows sum to powers of 2 (row n sums to 2^n, the total number of subsets). Its diagonals hide the triangular numbers, the tetrahedral numbers, and the Fibonacci sequence. The calculator gives you any single entry instantly, but the triangle shows how every entry relates to its neighbors — one of mathematics' most elegant objects.

The Binomial Theorem Connection

The numbers this calculator produces are called binomial coefficients for a reason: they are the coefficients in the expansion of (x + y)^n. Expand (x + y)^5 and you get x^5 + 5x^4y + 10x^3y^2 + 10x^2y^3 + 5xy^4 + y^5 — the coefficients 1, 5, 10, 10, 5, 1 are exactly C(5, 0) through C(5, 5), row 5 of Pascal's triangle. Every n-choose-r value this calculator returns is one coefficient of one binomial expansion.

This is far more than a curiosity. The binomial distribution — the workhorse of introductory statistics — computes the probability of exactly r successes in n independent trials as C(n, r) × p^r × (1−p)^(n−r). Flipping a fair coin 10 times, the probability of exactly 6 heads is C(10, 6) × 0.5^10 = 210/1024, about 20.5 percent. The combination count does the heavy lifting; the p^r(1−p)^(n−r) term just weights it.

The same coefficients appear in algebra (expanding polynomials), calculus (the binomial series generalizes the theorem to non-integer exponents), and computer science (counting binary strings with exactly r ones among n positions is C(n, r)). When you compute C(52, 5) = 2,598,960, you are simultaneously finding a poker count, a polynomial coefficient, and the number of 52-bit strings with exactly 5 ones. One number, many worlds — that is the quiet power of combinatorics.

Beyond its beauty, the triangle is a practical computation tool: building a row requires only addition, so historical mathematicians computed large combinations centuries before electronic calculators existed. If you ever need C(30, 15) without a device, start from row 0 and add your way down — thirty rows of simple addition gets you 155,117,520.

Tips for Solving Combinatorics Problems

1. Ask "does order matter?" first. This single question decides between combinations and permutations, and getting it wrong is the most common error in combinatorics.
2. Check whether repetition is allowed. The standard C(n, r) formula assumes each item can be chosen at most once. Choosing with repetition uses a different formula: C(n + r − 1, r).
3. Use symmetry to simplify. C(n, r) equals C(n, n − r). Choosing 47 cards to leave out of 52 is the same count as choosing 5 to keep — and the smaller number is easier to compute.
4. Break complex counts into stages. If a problem has multiple independent choices, compute each stage's count and multiply them together.
5. Watch for the "at least one" trick. Counting outcomes with at least one success is usually easier via the complement: total outcomes minus outcomes with zero successes.
6. Verify small cases by hand. Before trusting C(50, 6), check that the calculator gives C(5, 2) = 10, which you can enumerate manually.
7. Remember r = 0 and r = n. There is exactly 1 way to choose nothing and 1 way to choose everything. Edge cases like these catch formula errors.
8. Convert counts to probabilities last. Compute the raw counts first, then divide by the total sample space. Mixing the steps invites mistakes.

Frequently Asked Questions

1. What does "n choose r" mean?

It is the number of ways to select r items from a set of n distinct items when the order of selection does not matter. Written C(n, r) or with the binomial coefficient notation, it equals n! / (r! × (n − r)!). For example, C(52, 5) = 2,598,960 possible poker hands.

2. What is the difference between combinations and permutations?

Combinations ignore order — the hand A-K-Q-J-10 is one combination regardless of deal order. Permutations count every ordering separately — 120 orderings of those same 5 cards. Use combinations when arrangement is irrelevant, permutations when it changes the outcome.

3. What is the formula for n choose r?

C(n, r) = n! / (r! × (n − r)!). In practice, the multiplicative form is better for computation: multiply r terms starting from n, then divide by r!. This calculator uses exact integer arithmetic so even huge results like C(100, 50) come out precisely.

4. What happens if r is greater than n?

The result is undefined — you cannot choose 7 items from a set of 5. The calculator validates your input and asks for values with 0 ≤ r ≤ n before computing anything.

5. What is C(n, 0) and C(n, n)?

Both equal 1. There is exactly one way to choose nothing from n items (the empty selection) and exactly one way to choose all n items. These edge cases fall straight out of the formula since 0! = 1.

6. How do you calculate lottery odds with n choose r?

Identify n (the pool of numbers) and r (how many are drawn), then compute C(n, r). A 6-from-49 lottery has C(49, 6) = 13,983,816 possible draws, so one ticket's jackpot probability is 1 in 13,983,816. The calculator's probability row gives you this directly.

7. Why are permutations always bigger than combinations?

Because every combination of r items can be arranged in r! different orders, and permutations count each arrangement separately. P(n, r) = C(n, r) × r!. For r = 5, permutations are exactly 120 times the combinations.

8. What is the largest n the calculator handles?

Values of n up to 1000 are supported. Results can have hundreds of digits — C(1000, 500) has 300 digits — and the calculator returns every one of them exactly, with a thousand-separator version for readability.

9. What does the "1 in N" probability row mean?

It expresses the chance of one specific combination occurring if all combinations are equally likely: 1 divided by C(n, r). For poker it reads "1 in 2,598,960" — the odds of being dealt one particular 5-card hand.

10. Can n choose r handle repeated items?

The standard formula assumes distinct items chosen at most once each. If repetition is allowed — like choosing 3 scoops from 10 flavors where repeats are fine — the count is C(n + r − 1, r) instead. This calculator implements the standard no-repetition version.

11. How is n choose r used in probability?

It counts the favorable outcomes. The probability of an event equals favorable outcomes divided by total outcomes, and both counts are often combinations. The binomial distribution — the probability of exactly r successes in n trials — has C(n, r) as its leading term.

12. What is Pascal's triangle?

A triangular arrangement where row n lists C(n, 0) through C(n, n). Each entry is the sum of the two above it. It encodes subset counts, powers of 2, triangular numbers, and the binomial expansion coefficients all in one elegant diagram.

13. Why does the calculator show the formatted version separately?

Because a 300-digit integer with no separators is nearly impossible to read or verify. The formatted row inserts thousand separators — 2,598,960 instead of 2598960 — so you can scan the magnitude at a glance and copy it into reports cleanly.

14. Is C(n, r) the same as the binomial coefficient?

Yes. "Binomial coefficient," "n choose r," and C(n, r) all denote the same number: n! / (r! × (n − r)!). It is called binomial because these numbers are the coefficients in the expansion of (x + y)^n.

15. How can I verify the calculator's result by hand?

Test a small case you can enumerate: C(5, 2) should be 10 — list all pairs from {A, B, C, D, E} and count them. Then use the symmetry property C(n, r) = C(n, n − r) as a cross-check on larger inputs. Both should match the calculator exactly.

CONCLUSION

From poker tables to lottery tickets to genetics labs, the question "how many ways can I choose r from n?" shows up everywhere — and the answers are almost always bigger than intuition guesses. The N Choose R Calculator delivers exact combinations, permutations, and single-outcome probabilities with precision arithmetic that never rounds and never overflows. Enter your n and r, and replace wonder with a number: 2,598,960 poker hands, 13,983,816 lottery draws, or whatever your own problem counts out to.