Combinations & Permutations
Calculate combinations C(n,k) and permutations P(n,k) with formulas and results for large numbers. Essential for combinatorics.
Combination — C(n,k) — order does NOT matter
Permutation — P(n,k) — order MATTERS
When to use each?
Reach for the Combination C(n,k) whenever the order of the elements is irrelevant. Picture choosing 3 people out of a group of 10 for a committee: who gets picked first makes no difference.
The Permutation P(n,k) comes in when order does matter. That is the case for counting how many podiums (1st, 2nd, 3rd place) a race with 10 drivers can produce, since each position counts.
Combinatorics: formulas and counting
Combinatorial analysis counts arrangements of objects. A permutation of n elements is P(n) = n! — all possible orderings. An arrangement of n objects taken k at a time, where order matters, is A(n,k) = n! / (n−k)!. A combination, where order does not matter, is C(n,k) = n! / (k!·(n−k)!), also written as the binomial coefficient (n choose k). These coefficients are exactly the entries of Pascal's triangle. The fundamental counting principle says: if a process has independent steps with a, b, c… outcomes, the total is a·b·c… Examples: a 4-digit numeric password without repeated digits has A(10,4) = 5040 options; a 5-card poker hand from a standard deck has C(52,5) = 2,598,960 possibilities; Brazil's Mega-Sena lottery (choose 6 of 60) has C(60,6) = 50,063,860.
Applications: probability, cryptography and biology
Combinatorics underpins probability (Laplace's classical formula counts favorable cases over possible cases), cryptography (a k-bit key has 2^k possible values), genetics (allele combinations) and bioinformatics (sequence alignment counts). It is standard content in Brazilian university-entrance exams (ENEM, vestibular).
FAQ
Combination or arrangement? If order matters (podium, password, license plate), use arrangement. If order does not matter (committee, lottery, poker hand), use combination.
What is 0!? By convention, 0! = 1 — this keeps formulas like C(n,0) = 1 consistent.
What if k > n? Both C(n,k) and A(n,k) are 0 — you cannot choose more elements than exist.
Why does C(n,k) = C(n,n−k)? Choosing which k to include is equivalent to choosing which n−k to exclude.
Related Tools
Big Factorial (BigInt)
Compute n! up to 1000 with BigInt and show full result + digit count.
Factorial Calculator
Compute n! (factorial) for any integer up to 170 (double precision limit). Above that, returns exact BigInt. Useful for combinatorics, probability and discrete math. Everything in your browser.
Gunning Fog Index Calculator
Computes Gunning Fog reading complexity index from words, sentences and complex words with three or more syllables in the text.
Net Assimilation Rate (Gregory Formula)
Computes the net assimilation rate of a plant by the classic Gregory formula, the core of plant growth analysis. The rate is the dry matter gain per day multiplied by the ratio between the difference of the natural logarithms of the two leaf areas and the difference of the areas themselves: NAR = [(W2 − W1) ÷ interval] × [ln(A2) − ln(A1)] ÷ (A2 − A1). The result measures net photosynthetic efficiency per unit of leaf area, with respiration already discounted — typical values for annual crops in full growth lie between 5 and 15 grams per square metre of leaf per day, and a decline along the cycle indicates canopy self-shading. Gregory's (1926) logarithmic form was adopted rather than the approximation NAR = mass gain ÷ (mean leaf area × interval), because the former is exact when leaf area grows linearly with dry mass over the interval, which is the standard assumption of classic growth analysis. Enter the initial and final dry masses, the initial and final leaf areas and the interval between the two samplings.
One-Way ANOVA
Computes one-way analysis of variance (ANOVA), the test that checks whether three or more groups have different means. It decomposes the total variation into between-group and within-group variation, and the ratio between them (the F-statistic) indicates whether the observed differences are larger than would be expected by chance. It's the generalization of the t-test to multiple groups. Enter the groups: values separated by commas, groups separated by semicolons.
Permutations P(n,k) Calculator
Calculate permutations P(n,k), the number of ordered arrangements of k items chosen from n. Useful for probability, draws and combinatorics.
The results provided by this tool are for general informational and educational purposes only and do not constitute professional, financial, medical, legal, tax or accounting advice. Always confirm important decisions with a qualified professional and official sources.