Permutation and Combination Calculator

Permutations count ordered arrangements; combinations count unordered selections.

How the Math Works

Permutations and combinations are fundamental counting principles in mathematics. Permutations (nPr) calculate the number of ways to arrange 'r' items selected from 'n' distinct items where order matters, using the formula n!/(n−r)!. Combinations (nCr) determine the number of ways to choose 'r' items from 'n' without considering order, calculated as n!/(r!(n−r)!). The factorial notation (!) represents the product of all positive integers up to that number, forming the basis for these calculations.

Practical Applications

These calculations are essential in probability, statistics, and decision-making scenarios. Permutations apply when sequence matters, such as arranging books on a shelf, creating passwords, or determining race finish orders. Combinations are used when selecting items without sequence, like forming committees from a group, choosing lottery numbers, or picking pizza toppings. They help solve problems involving arrangements, selections, and probability assessments in fields like computer science, finance, and engineering.

Day-to-Day Use

In daily life, permutations and combinations aid practical decisions. Permutations help design efficient schedules, organize events, or secure passwords by calculating possible sequences. Combinations assist in meal planning (choosing ingredients), shopping (selecting products within a budget), or sports team selection (picking players). They also enhance understanding of risk in games, insurance, or investment choices by quantifying possible outcomes and their likelihoods.

Worked example

From 10 items choose 3: nPr = 720, nCr = 120.

FAQ