When should I use combinations with repetition (nHr)?

Use nHr when you choose r items from n distinct categories, where each category can be picked multiple times, and the order of selection is irrelevant (e.g., buying 10 donuts from 4 flavors).

Why does the factorial function grow so aggressively?

Factorial growth is super-exponential, outpacing exponential functions like 2^n or e^n. 10! is 3.6 million, 20! is 2.43 quintillion, and 70! exceeds the number of elementary particles in the known universe.

Why does circular permutation use (n-1)! instead of n!?

In a circle, rotating the entire arrangement by one seat does not alter the relative left-to-right neighbor relationships. Since there are n rotational symmetries for every arrangement, we divide n! by n, leaving (n - 1)!.

How does a lottery bonus ball affect the odds calculation?

In a 6/45 format, matching 6 numbers is 1 in 45C6 = 8,145,060. To win 2nd tier (matching 5 numbers plus the bonus ball), there are 6C5 × 1 = 6 winning combinations, resulting in an exact odds ratio of 6 in 8,145,060 (1 in 1,357,510).

What are the computational limits of rendering all permutations in code?

Because generating all permutations runs in O(n!) time, attempting to materialize permutations beyond n=10 (3.6 million items) in a web browser will exhaust JavaScript heap memory. Beyond n=10, compute analytical counts rather than brute-force array generation.

Permutation, Combination & Factorial Calculator

HOT

Calculate permutations (nPr), combinations (nCr), repeated combinations, and factorials (n!) with step-by-step reduction.

ADVERTISEMENT · TOP BANNER

Responsive 728x90 / 320x100 Ad Slot

(CLS Prevention Active · Zero Shift)

100% Client-Side Processing (Zero Server Upload, Complete Privacy)

Interactive Client Mode

Presets:

Total Items (n)

Total number of available items

Selected Items (r)

Number of items to choose or arrange

Total PossibilitiesnCr = n! / (r! × (n - r)!)

8,145,060

Steps:45C6 = (45! ) / (6! × 39!)

100% BigInt Precision

ADVERTISEMENT · HIGH CTR IN-FEED

Native In-Feed / High Viewability Ad Slot

(CLS Prevention Active · Zero Shift)

Comprehensive Guide to Permutations (nPr), Combinations (nCr), and Factorials (n!)

Combinatorics forms the bedrock of modern quantitative disciplines, spanning cryptography entropy calculations, algorithm complexity evaluations, poker odds estimation, and machine learning hyperparameter grid search.

The fundamental decision when counting possibilities lies in two dimensions: does order matter (Permutation vs Combination), and are items allowed to repeat (Without vs With Repetition). Choosing the wrong model yields errors varying by orders of magnitude.

OrvoKit Permutation and Combination Calculator delivers exact mathematical solutions for factorials (n!), permutations (nPr), combinations (nCr), repeated permutations (nΠr), multiset combinations (nHr), and circular arrangements using native BigInt precision.

Mathematical Foundations of Combinatorial Operations

Derivation of fundamental formulas based on factorial algebra and division by symmetry groups.

Core Combinatorial Formula SetMathematical Formulation

nPr = n! / (n - r)! nCr = n! / (r! × (n - r)!) = nPr / r! nΠr = n^r nHr = (n + r - 1)Cr

Combinations divide permutations by r! to neutralize the internal ordering of selected items. Repeated combinations (nHr) utilize the classic Stars and Bars bijection method into an ordinary combination.

Calculating winning odds for a 6/45 lottery draw

Formula SelectionChoosing 6 unique numbers out of 45 without replacement where order does not matter: 45C645! / (6! × 39!)

Numerator Expansion45 × 44 × 43 × 42 × 41 × 405,864,443,200

Denominator Expansion6 × 5 × 4 × 3 × 2 × 1720

Final Division5,864,443,200 / 7208,145,060

👉 The exact probability of jackpot victory is 1 in 8,145,060.

Combinatorial Models Classification Matrix

Four quadrants based on order sensitivity and item replacement

Symbol	Name	Order Matters?	Replacement?	Formula	Real-World Application
n!	Factorial	Yes (Full order)	No	n × (n-1) × ... × 1	Sequencing 5 sprinters across a finish line
nPr	Permutation	Yes (Ranked slots)	No	n! / (n - r)!	Electing President, VP, and Treasurer from 10 peers
nCr	Combination	No (Set subset)	No	n! / (r!(n - r)!)	Drawing 6 winning balls in a national lottery
nΠr	Permutation w/ Repetition	Yes (Position specific)	Yes	n^r	4-digit numeric PIN password permutations (10^4)
nHr	Combination w/ Repetition	No (Tally counts)	Yes	(n + r - 1)Cr	Selecting 5 scoops from 3 ice cream flavors
(n-1)!	Circular Permutation	Rotational Equivalence	No	(n - 1)!	Arranging 6 guests around a round dining table

ADVERTISEMENT · IN-ARTICLE CONTENT

High-Engagement In-Article Native Ad Slot

(CLS Prevention Active · Zero Shift)

How to Use

11. Select Calculation Mode

Choose between Combination (nCr), Permutation (nPr), Factorial (n!), Repeated Permutation, Repeated Combination, or Circular Permutation.

22. Input Total Items (n)

Enter the total pool size n as a non-negative integer.

33. Input Chosen Items (r)

Specify the number of items r to be selected or arranged (not required for n! and circular).

44. Review Steps & Copy

Inspect the exact step-by-step reduction formula and click [Copy Result] to save the formatted output.

Practical Industrial & Academic Use Cases

Everyday implementations in computer science, statistics, and game theory

Password Entropy Estimation

Evaluating a password space of 94 ASCII characters over 8 positions yields 94^8 = 6.09×10^15 combinations to estimate brute-force cracking resistance.

Poker Hand Probability Modeling

Drawing 5 cards from a 52-card deck produces 52C5 = 2,598,960 total hands, used to set pay tables for video poker and card games.

Randomized Clinical Trial Cohort Assignment

Assigning 20 patients to a treatment group out of 100 participants leverages 100C20 to ensure unskewed randomized control trials.

💡 Expert Tips and Common Calculation Pitfalls

✓ Use Symmetry (nCr = nCn-r)

When computing 100C98, compute 100C2 instead: (100 × 99) / 2 = 4,950, avoiding 98 redundant multiplications.

✓ BigInt for Factorials > 20

Standard IEEE-754 double precision floats overflow above 21!. Always use arbitrary precision BigInt for exact factorials.

✓ The Stars and Bars Metaphor

To solve nHr, imagine placing n-1 separators between r identical stars, producing (n+r-1)Cr slots.

⚠️ Common Pitfalls & Mistakes to Avoid

❌ Assuming 0! = 0

✅ There is exactly 1 way to arrange an empty set; therefore mathematically 0! = 1, and nP0 = nC0 = 1.

❌ Trying to pick r > n without replacement

✅ In standard permutations and combinations without repetition, you cannot select more items than available; the answer is strictly 0.

Frequently Asked Questions (FAQ)

Expert answers to the most frequently asked questions and edge cases.

6 Q&As

Permutations account for the sequence or position of items (e.g. 1st, 2nd, 3rd place). Combinations treat groups as identical regardless of order (e.g. a team of 3 committee members).

ADVERTISEMENT · FOOTER BANNER

Wide Responsive Banner

(CLS Prevention Active · Zero Shift)

Related Tools

Math & Science View All →

Normal Distribution Z-Score & Binomial Probability Calculator

Compute standardized Z-scores, percentile ranks, and binomial trial probabilities with real-time SVG bell curve area shading.

Open Tool

Margin of Error & 95% Confidence Interval Calculator

Calculate survey margin of error (±%) and confidence intervals across 90%, 95%, and 99% levels, with reverse sample size estimation.

Open Tool

Percentage Master Calculator

All-in-one percentage calculator: What is X% of Y, proportion ratios, percentage change, and retail discounts.

Open Tool

Ohm's Law & Electric Power Calculator

Calculate Voltage, Current, Resistance, and Power instantly by providing any 2 known values.

Open Tool