Permutation and Combination Calculator

Exact nPr, nCr, repetition, circular and repeated-letter arrangements with big-number factorials, step-by-step working and a Pascal's triangle view.

Free, no sign-upRuns in your browserUpdated November 2026
Order matters → permutation. Order does not matter → combination.
Result
—
Step-by-step working
    Pascal's triangle

    How to use the Permutation and Combination Calculator

    1. Choose what you are counting: combinations (selections, order does not matter), permutations (arrangements, order matters), a repetition case, a circle, or the letters of a word.
    2. Enter n, the total number of items, and r, the number chosen. For words, type the word, for example MISSISSIPPI.
    3. Read the exact answer. Very large results are shown in scientific form, with every digit available to copy.
    4. Follow the steps to see the formula, the substituted values and how the factorials cancel, and use Pascal's triangle to check nCr.

    Permutations vs combinations

    Both count the ways of choosing r items from n different items. The difference is whether order matters.

    • Permutation (arrangement): order matters. Choosing a captain and a vice-captain, forming 3-digit numbers, or arranging books on a shelf.
    • Combination (selection): order does not matter. Picking a team of 3, choosing 5 questions out of 8, or drawing cards for a hand.

    This calculator follows the notation of the Permutations and Combinations chapter in NCERT Class 11 (nPr and nCr, also written nPr and nCr). All results are exact: factorials are computed with whole-number BigInt arithmetic, so even 1000! (2,568 digits) is shown in full.

    Formulas

    nPr = n! / (n − r)! (0 ≤ r ≤ n) nCr = n! / (r! (n − r)!) = nPr / r! Permutations with repetition = nʳ Combinations with repetition = (n + r − 1)Cr Circular permutations = (n − 1)! (necklace / garland: (n − 1)!/2 for n ≥ 3) Arrangements with repeats = n! / (p₁! p₂! … pₖ!)

    Here n! (n factorial) is n × (n − 1) × … × 2 × 1, and 0! = 1 by definition.

    Worked examples

    nPr: How many ways can gold, silver and bronze be awarded among 10 runners? Order matters, so 10P3 = 10!/7! = 10 × 9 × 8 = 720.

    nCr: How many 3-person committees can be chosen from 10 people? Order does not matter, so 10C3 = 720/3! = 720/6 = 120. Each committee was counted 3! = 6 times among the 720 ordered choices.

    Repeated letters: MISSISSIPPI has 11 letters: M once, I four times, S four times and P twice. The number of distinct arrangements is

    11! / (4! × 4! × 2!) = 39,916,800 / 1,152 = 34,650

    Circular: 6 people round a table can sit in (6 − 1)! = 120 ways, because rotating everyone one seat gives the same arrangement. For 6 different beads on a necklace, which can also be flipped over, the answer is 120/2 = 60.

    Which formula should I use?

    SituationOrder matters?Repetition?Formula
    Ranks, passwords with no repeats, seating in a rowYesNonPr
    PIN codes, number plates, answers to MCQsYesYesnʳ
    Teams, committees, hands of cardsNoNonCr
    Buying r sweets from n flavoursNoYes(n + r − 1)Cr
    Round table, ring of beadsYes, up to rotationNo(n − 1)! or (n − 1)!/2
    Letters of a word with repeatsYesIdentical itemsn! / (p₁! p₂! …)

    Pascal's triangle and nCr

    Row n of Pascal's triangle lists nC0, nC1, …, nCn. Each entry is the sum of the two entries above it, which is Pascal's rule: nCr = (n − 1)C(r − 1) + (n − 1)Cr. The rows are symmetric because nCr = nC(n − r), and row n adds up to 2ⁿ, the total number of subsets of n items. The same numbers are the coefficients in the binomial theorem expansion of (a + b)ⁿ.

    Common mistakes

    • Using nPr when order does not matter. Ask whether swapping two chosen items gives a new outcome. If not, use nCr.
    • Forgetting to divide for identical items. Arrangements of BOOK are 4!/2! = 12, not 24.
    • Treating a circle like a line. Seating n people in a row gives n! arrangements, but round a table it is (n − 1)!.
    • Computing huge factorials in full. In an exam, cancel first: 52C5 = (52 × 51 × 50 × 49 × 48)/5!.

    Exam tips for JEE and boards

    • Use nCr = nC(n − r) to shorten the work: 100C98 = 100C2 = 4950.
    • "At least one" questions are usually easier as total − none.
    • For dictionary-rank questions, count the arrangements that start with each smaller letter using the repeated-letters formula.
    • To count the divisors of a number (another common question), use its prime factorisation. The prime factorization calculator does this for you.

    Frequently asked questions

    What is the difference between permutation and combination?
    A permutation counts arrangements, where order matters. A combination counts selections, where order does not matter. Choosing a president and secretary from 5 people is 5P2 = 20, but choosing a 2-person committee is 5C2 = 10.
    How many ways can the letters of MISSISSIPPI be arranged?
    MISSISSIPPI has 11 letters with I repeated 4 times, S 4 times and P twice. The number of distinct arrangements is 11!/(4! × 4! × 2!) = 39,916,800/1,152 = 34,650.
    What is the value of 0!?
    0! is defined as 1. That keeps the formulas consistent: nCn = n!/(n! × 0!) = 1 and nP0 = 1. There is exactly one way to choose nothing.
    What is the formula for circular permutations?
    n different objects can be arranged in a circle in (n − 1)! ways, because rotations give the same arrangement. If the circle can also be flipped, like a necklace or garland, divide by 2 to get (n − 1)!/2 for n ≥ 3.
    How do I calculate nCr when n is large?
    Cancel before multiplying. Use nCr = nC(n − r) to make r small, then compute n(n − 1)…(n − r + 1)/r!. This calculator uses exact big integers, so it handles n up to 1000 with every digit correct.
    How is nCr related to nPr?
    nCr = nPr / r!. Every selection of r items can be ordered in r! ways, so the number of ordered arrangements is r! times the number of selections.

    Last reviewed November 2026. Results are estimates for information only — see our disclaimer.