📐

Permutation (nPr

Math Free Instant Private
Math

### Discrete Mathematics: When to Use Combinations vs. Permutations - **Combinations (\(nCr\))**: Used when grouping order is irrelevant. Examples include lottery numbers, poker card hands, fruit...

Reviewed by Miss Saima · MA Mathematics
Last updated:
Editorial Guidelines

⚙ Input Values

📊 Results

Primary Combinatorics Summary
nCr (Combinations): 210 | nPr (Permutations): 5040 (n = 10, r = 4)
Combinations: nCr (Order Does NOT Matter)
210 combinations (nCr = n! / [r!(n-r)!])
Permutations: nPr (Order DOES Matter)
5040 permutations (nPr = n! / (n-r)!)
Permutations WITH Repetition (n^r)
10,000 permutations (n^r)
Combinations WITH Repetition (n+r-1 C r)
715 combinations ((n+r-1) C r)
Single-Pick Probability Odds (1 / nCr)
1 in 210 (4.7619e-1%)
Step-by-Step Factorial Derivation
nCr = 10! / (4! × 6!) = 3628800 / (24 × 720) = 210
✦ Combinatorics & Discrete Mathematics Diagnostic
Combinatorial Analysis: From a set of n = 10 distinct items choosing r = 4 items: [1] Combinations nCr (order does not matter): 210 unique subsets. [2] Permutations nPr (order matters): 5040 ordered sequences. [3] With replacement/repetition allowed: n^r = 10,000 permutations and 715 combinations. Exact probability of randomly picking any 1 specific combination is 1 in 210 (4.7619e-1%). Factorial proof: nCr = 10! / (4! × 6!) = 3628800 / (24 × 720) = 210.
Embed on Your Website

Copy and paste this code into your website.

<iframe src="https://calcusolve.com/calculator/permutation-combination-calculator?embed=true" width="100%" height="600" frameborder="0" loading="lazy" title="Permutation (nPr"></iframe>

📐 Formula

Discrete combinatorics & permutation/combination formulas: (Order does NOT matter): C(n, r) = nr = (n! ÷ r!(n - r)!) (Order DOES matter): P(n, r) = (n! ÷ (n - r)!) WITH Repetition: n^r WITH Repetition: n + r - 1r = ((n + r - 1)! ÷ r!(n - 1)!) Selection Probability: P(Event) = (1 ÷ n)r

💡 Practical Example

✅

For example, selecting a 4-person committee) from a pool of 10 candidates): Since committee member order does not matter, combinations \. If assigning specific ranked officer titles (President, VP, Treasurer, Secretary), order matters, so permutations \(P(10, 4) = \frac{10!}{6!} = \mathbf{5,040\text{ ordered permutations}}\).

📖 About Permutation (nPr

Discrete Mathematics: When to Use Combinations vs. Permutations

  • Combinations (nCr): Used when grouping order is irrelevant. Examples include lottery numbers, poker card hands, fruit salad ingredients, and committee selections.
  • Permutations (nPr): Used when the sequence order changes the outcome. Examples include digital PIN codes, password combinations, race finishing placements (1st, 2nd, 3rd), and phone numbers.

How to Use This Calculator

Enter your Total Number of Items in Set (n ≥ 0) (e.g. 10) and Number of Items Chosen / Sampled (r ≤ n) (e.g. 4). Results update instantly as you type — adjust any value to compare scenarios.

The Formula

Discrete combinatorics & permutation/combination formulas: (Order does NOT matter): C(n, r) = nr = (n!) / (r!(n - r)!) (Order DOES matter): P(n, r) = (n!) / ((n - r)!) WITH Repetition: n^r WITH Repetition: n + r - 1r = ((n + r - 1)!) / (r!(n - 1)!) Selection Probability: P(Event) = (1) / (n)r

Worked Example

For example, selecting a 4-person committee) from a pool of 10 candidates): Since committee member order does not matter, combinations . If assigning specific ranked officer titles (President, VP, Treasurer, Secretary), order matters, so permutations P(10, 4) = (10!) / (6!) = 5,040 ordered permutations.

Understanding Your Result

Evaluate your result in the context of your specific use case and relevant industry standards or reference values. A single calculated result is a starting point — test two to three scenarios to understand how sensitive the outcome is to your key input assumptions. For high-stakes decisions, verify your result against a secondary source or subject-matter expert before acting.

💡 Mathematical Rigor & Applied Context

  • This calculator applies exact mathematical definitions following conventions established by NIST and international standards bodies.
  • Rounding errors accumulate across multi-step calculations. For precision-critical work, maintain extra significant figures through all intermediate steps.
  • Many mathematical concepts have multiple valid formulations — if a result seems unexpected, verify which convention or definition applies to your context.
  • Dimensional analysis (unit tracking) is the fastest way to catch formula errors. Every term in an equation must have consistent, compatible units.
  • Numerical methods used in digital calculators introduce floating-point precision limits (~15 significant digits for IEEE 754 double precision).
  • For statistical and probabilistic calculations, always specify whether you are working with population parameters or sample statistics — formulas differ.
  • Visualizing a problem geometrically or testing with known boundary values (zero, infinity, negative) reveals hidden errors faster than algebraic checking.
  • When in doubt, validate your result against a simplified hand calculation or a published worked example from a textbook or standards document.

Results are for informational and educational purposes only. Always verify critical decisions with a qualified professional.

❓ Frequently Asked Questions

What is the main difference between permutations and combinations?

Order matters in permutations (e.g. PIN codes 1-2-3 and 3-2-1 are different). Order does NOT matter in combinations (e.g. a hand with Ace-King is the same as King-Ace).

What is the formula for nCr?

nCr = n! ÷ [r! × (n - r)!], where n is the total number of items, r is the number chosen, and ! represents factorial.

What is 0 factorial (0!)?

By mathematical convention and combinatorics definition, 0! equals exactly 1.

How many 5-card poker hands can be dealt from a standard 52-card deck?

Using combinations 52C5: 52! ÷ = 2,598,960 unique possible poker hands.

How does repetition change the calculation?

When items can be chosen multiple times (with replacement), permutations become n^r, and combinations become! ÷ [r! × (n - 1)!].

Try Other Calculators