Back to home

Permutation & Combination Calculator

Calculate P(n,r) and C(n,r) with factorial working and Pascal's triangle row.

Inputs
P(n,r) = n!/(n−r)!  |  C(n,r) = n!/(r!(n−r)!)

Permutations vs. Combinations

A permutation is an arrangement where order matters. P(n,r) counts the number of ways to arrange r items from n distinct items in a specific order. A combination is a selection where order doesn't matter — C(n,r) counts the number of ways to choose r items from n without regard to order.

Real-World Examples

Permutations: arranging 3 books from a shelf of 10, assigning gold/silver/bronze medals. Combinations: choosing a team of 3 from 10 players, picking lottery numbers. Remember: P(n,r) = C(n,r) × r! because every combination can be arranged in r! ways.

Pascal's Triangle

Pascal's triangle displays all combinations for a given n in a single row. Row n contains C(n,0), C(n,1), …, C(n,n). The values in any row sum to 2ⁿ and are the binomial coefficients used in the binomial theorem.

Take this calculation further

Browse the math calculators collection for more tools in this subject.

For a related calculation, use Z-Score Calculator to convert values to z-scores and percentiles, or find the percentile for any z-score using the standard normal distribution. Alternatively, use Probability Calculator to calculate probabilities for single events, two independent events, and conditional probability.

For the underlying method, read Understanding Standard Deviation and Why It Matters or A Practical Guide to Statistical Sample Size: How Many People Do You Actually Need to Survey?.