Permutation Calculator

A permutation is an arrangement of objects in a specific order. The key distinction that separates permutations from combinations is that order matters. If you're selecting a president, vice president, and treasurer from a group of 10 people, the arrangement (Alice, Bob, Charlie) is different from (Bob, Alice, Charlie) because different people hold different positions. That's a permutation problem.

I've found that the easiest way to think about permutations is through the "filling slots" method. If you have 10 candidates and 3 positions, there are 10 choices for the first position, 9 for the second (since one person is already chosen), and 8 for the third. Multiply those together: 10 * 9 * 8 = 720 permutations. This is exactly what the formula P(n,r) = n! / (n-r)! calculates.

The concept goes back centuries. The study of permutations and combinations was formalized in the 17th century, but arrangements and counting problems have fascinated mathematicians since antiquity. The Indian mathematician Mahavira explored permutations as early as the 9th century, and Blaise Pascal's triangle (developed in the 17th century) provides an elegant visual tool for computing combinations.

I this permutation calculator because I needed a dependable tool that shows the work. When you're learning combinatorics or preparing for an exam, understanding each step is more valuable than just getting the final number. This tool handles permutations, combinations, factorials, and arrangements with repetition, covering all the main counting problems you'll encounter.

The word "permutation" comes from the Latin "permutare," meaning "to change thoroughly." In modern mathematics, a permutation can refer either to the act of arranging objects or to the arrangement itself. Both usages are standard, and the context usually makes it clear which meaning is intended. In this calculator and guide, I use "permutation" primarily to mean the number of possible arrangements.

Last verified March 2026

The difference between permutations and combinations is one of the most basic distinctions in counting theory, and I've seen it trip up students more than almost any other concept in mathematics. Here's the simple rule: if order matters, use permutations. If order doesn't matter, use combinations.

When Order Matters · Permutations

Think about a podium finish in a race. First, second, and third place are all different outcomes even if the same three runners are involved. A four-digit PIN code is another example: 1234 and 4321 use the same digits but are completely different codes. Arranging books on a shelf, assigning roles in a team, creating passwords, and ranking candidates are all permutation problems.

I like to use the "label test" to determine if order matters. If the selected items get labels (like 1st/2nd/3rd, or president/treasurer, or position 1/2/3/4 in a password), then it's a permutation. If the items are simply "chosen" without any distinguishing role, it's a combination.

When Order Doesn't Matter · Combinations

Selecting a committee of 3 people from 10 is a combination problem because the committee {Alice, Bob, Charlie} is the same committee as {Charlie, Alice, Bob}. Choosing 5 cards from a deck, selecting toppings for a pizza, or picking lottery numbers are combination problems because only the selection matters, not the arrangement.

Here's another way I think about it: if you can "shuffle" the selected items and the result doesn't change, it's a combination. The committee stays the same regardless of the order members are listed. But a password changes if you shuffle its characters, so it's a permutation.

A useful relationship connects the two: P(n,r) = C(n,r) * r!. In other words, the number of permutations equals the number of combinations multiplied by the number of ways to arrange the chosen items. This makes sense because for every combination, there are r! ways to arrange those r items, and each arrangement counts as a separate permutation.

Standard Permutation (without repetition)

P(n,r) = n! / (n-r)! where n is the total number of objects and r is how many you're choosing. This formula counts the number of ordered arrangements when each object can only be used once. For example, P(10,3) = 10! / 7! = 10 * 9 * 8 = 720.

The notation varies across textbooks and countries. You might see nPr, P(n,r), P_r^n, or even A(n,r) (where A stands for "arrangements," the term used in some European traditions). They all mean the same thing. This calculator uses P(n,r) notation, which is standard in American mathematics education.

Standard Combination (without repetition)

C(n,r) = n! / (r! * (n-r)!). This is always smaller than the corresponding permutation because we divide out the r! arrangements that combinations consider equivalent. C(10,3) = 10! / (3! * 7!) = 720 / 6 = 120.

Combinations are also written as "n choose r" and denoted with the binomial coefficient notation. The binomial theorem, which describes how to expand expressions like (a + b)^n, uses these exact combination values as coefficients. This connection between counting and algebra is one of the most elegant results in mathematics.

Permutation with Repetition

When repetition is allowed (like choosing digits for a code where you can reuse digits), the formula simplifies to n^r. If you have 10 digits (0-9) and need a 4-digit code, there are 10^4 = 10,000 possible codes. I find this the most formula because each of the r positions has n independent choices.

The key difference from standard permutations is that the pool of choices doesn't shrink after each selection. In a standard permutation, after choosing the first item from 10, you have 9 left. With repetition, you still have 10 choices for every subsequent position. This is why the result is typically much larger.

Combination with Repetition

Also called "multiset coefficients," the formula is C(n+r-1, r) = (n+r-1)! / (r! * (n-1)!). This counts selections where you can pick the same item multiple times but order doesn't matter. For example, choosing 3 scoops of ice cream from 5 flavors where you can repeat flavors: C(5+3-1, 3) = C(7,3) = 35.

This is sometimes called the "stars and bars" method in combinatorics. Imagine distributing r identical stars into n distinct bins (separated by n-1 bars). The number of ways to do this is exactly C(n+r-1, r). It's a beautiful technique that I've used to solve problems ranging from distributing candies among children to counting solutions of equations in non-negative integers.

Factorial

The factorial function n! = n * (n-1) * (n-2) *. * 2 * 1 is the building block of all permutation and combination formulas. It counts the number of ways to arrange n distinct objects in a line. 0! is defined as 1, which might seem counterintuitive, but it's necessary for the formulas to work correctly. There's exactly one way to arrange zero objects: do nothing. Factorials grow incredibly fast: 10! = 3,628,800 and 20! = 2,432,902,008,176,640,000. This calculator handles values up to 170!, which is near the limit of standard floating-point arithmetic.

The gamma function extends factorials to non-integer values, satisfying Gamma(n) = (n-1)! for positive integers. While this calculator focuses on integer factorials, the gamma function is important in modern statistics and physics. If you ever see 0.5! (which equals sqrt(pi)/2, approximately 0.8862), it's computed via the gamma function.

Example 1 · Class Officers

A club of 15 members needs to elect a president, vice president, secretary, and treasurer. How many different officer configurations are possible?

Since different positions mean order matters, this is a permutation: P(15,4) = 15! / 11! = 15 * 14 * 13 * 12 = 32,760 possible officer configurations. I've used this exact type of problem in workshops, and it's a great way to see why permutations produce much larger numbers than combinations. If we were just choosing 4 committee members without specific roles, it would only be C(15,4) = 1,365.

Example 2 · Lottery Numbers

A lottery requires choosing 6 numbers from 1 to 49. How many possible tickets exist?

Since the order of the numbers on a lottery ticket doesn't matter (picking 3-7-12-25-33-49 is the same as 49-33-25-12-7-3), this is a combination: C(49,6) = 49! / (6! * 43!) = 13,983,816. Your chance of winning with a single ticket is about 1 in 14 million. This is why I always say the lottery is a tax on people who don't understand combinatorics.

Example 3 · Password Strength

How many possible 8-character passwords exist using lowercase letters (26), uppercase letters (26), digits (10), and 10 special characters?

With 72 possible characters per position and repetition allowed, this is a permutation with repetition: 72^8 = 722,204,136,308,736 (over 722 trillion). This illustrates why longer passwords are dramatically more secure. Each additional character multiplies the total by 72. Adding just two more characters (making it 10) gives 72^10, which is over 3.7 quadrillion combinations.

For context, a computer making 10 billion guesses per second would take about 20 hours to try all 8-character passwords from this set. Extending to 10 characters pushes that to nearly 12 years. This exponential growth is why security experts recommend longer passphrases over complex short passwords.

Example 4 · Multiset Selection

An ice cream shop has 8 flavors. If you can order a triple scoop with repeated flavors, how many different orders are possible?

This is a combination with repetition because order doesn't matter (chocolate-vanilla-vanilla is the same as vanilla-chocolate-vanilla) but repetition is allowed. C(8+3-1, 3) = C(10,3) = 120 possible orders. If you couldn't repeat flavors, it would be just C(8,3) = 56.

Example 5 · Phone Numbers

How many distinct 10-digit phone numbers can exist in the US, given the first digit can't be 0 or 1?

The first digit has 8 choices (2-9), and each of the remaining 9 digits has 10 choices (0-9). This is a permutation with repetition: 8 * 10^9 = 8,000,000,000 possible numbers. In practice, additional rules (area codes, exchange codes) reduce this number significantly, but the basic combinatorial calculation gives the theoretical maximum.

Computer Science and Cryptography

Permutations are central to cryptography. Encryption algorithms like AES operate by performing complex permutations on data. The security of these systems depends on the astronomical number of possible permutations. A 256-bit key has 2^256 possible arrangements, a number so large that brute-force attacks are physically impossible. Understanding permutation mathematics helps explain why modern encryption is secure.

In programming, permutation algorithms (like Heap's algorithm) are basic to solving problems, and I've found that understanding the math behind them makes writing fast code much easier. Many competitive programming problems reduce to counting permutations or combinations. The time complexity of generating all permutations is O(n * n!), which is why these algorithms become impractical for large n values.

Genetics and Molecular Biology

DNA consists of four nucleotides (A, T, G, C) arranged in specific sequences. A gene that's 1000 nucleotides long has 4^1000 possible sequences, a number with over 600 digits. Combinatorics helps biologists understand genetic variation, calculate the probability of specific mutations, and analyze protein folding possibilities. The human genome contains about 3 billion base pairs, and understanding the combinatorial space of possible genomes is important for evolutionary biology.

Sports Scheduling and Tournaments

Scheduling a round-robin tournament for n teams requires calculating C(n,2) games (each pair plays once). For 20 teams, that's C(20,2) = 190 games. If home/away matters, it doubles to P(20,2) = 380. March Madness brackets have 2^63 possible outcomes for a 64-team tournament, which is why filling out a bracket is essentially impossible.

I've used permutation calculations for fantasy sports draft analysis as well. If your fantasy league has 12 teams and 15 rounds, the total number of possible draft outcomes is staggeringly large. Understanding the combinatorial field helps explain why no two drafts are ever the same and why draft strategy remains a fascinating problem.

Business and Product Design

Companies use permutation analysis for product configuration. If a car comes in 8 colors, 3 trims, 4 engine options, and 2 transmission types, there are 8 * 3 * 4 * 2 = 192 possible configurations. I've worked with product teams who needed to understand how many SKUs would result from different feature combinations, and this type of combinatorial analysis directly drives inventory and manufacturing decisions.

Music and Composition

The 12-tone technique in music composition, developed by Arnold Schoenberg, is fundamentally about permutations of the 12 chromatic notes. A tone row arranges all 12 notes in a specific order, and there are 12! = 479,001,600 possible rows. Composers work with permutations, inversions, and retrogrades of these rows to create systematic compositions. Even in popular music, the number of possible melodies within a given scale and rhythm is a combinatorial question.

This video gives a clear visual explanation of permutations and combinations. I've found it particularly helpful for building intuition about when order matters and when it doesn't.

Circular Permutations

When objects are arranged in a circle rather than a line, the number of permutations is (n-1)! instead of n!. This is because rotating a circular arrangement doesn't create a new arrangement. Seating 6 people around a round table has (6-1)! = 120 distinct arrangements, not 720. I've seen this concept come up frequently in chemistry (molecular arrangements) and scheduling (rotating shifts).

The reasoning is elegant: in a circular arrangement, we can fix one person's position (to remove the rotational symmetry) and then arrange the remaining (n-1) people in the remaining seats. This gives (n-1)! arrangements. If the arrangement can also be reflected (like a bracelet that can be flipped), we divide by 2, giving (n-1)!/2 distinct arrangements.

Permutations with Identical Objects

If some objects are identical, we divide by the factorial of each group of identical items. The word "MISSISSIPPI" has 11 letters but only 34,650 distinct arrangements because of the repeated letters: 11! / (4! * 4! * 2!) = 34,650. The four S's, four I's, and two P's each create indistinguishable swaps.

This concept extends to any situation where items within groups are interchangeable. Distributing 5 identical red balls and 3 identical blue balls into 8 positions: 8! / (5! * 3!) = 56. I find this formula particularly useful in probability calculations where outcomes involve repeated elements.

Derangements

A derangement is a permutation where no element appears in its original position. If 5 people throw their hats into a pile and each picks one randomly, the number of ways that nobody gets their own hat is D(5) = 44. The formula for derangements uses the inclusion-exclusion principle, and the probability of a complete derangement approaches 1/e (about 36.8%) as n grows large. This result surprises many people because it doesn't depend on how large n is.

Derangements have practical applications in cryptography (fixed-point-free permutations) and in testing random number generators. A surprising consequence is that even for a million objects, the probability that a random permutation has no fixed points is still approximately 36.8%.

Stirling's Approximation

For very large n, calculating n! directly becomes impractical. Stirling's approximation gives n! approximately equal to sqrt(2*pi*n) * (n/e)^n. This approximation is remarkably precise even for moderately small values and is widely used in statistical mechanics and information theory. For n = 10, Stirling's gives 3,598,695 versus the exact 3,628,800, an error of less than 1%. The Wikipedia article on permutations covers these modern topics in detail.

For programmers, the js-combinatorics package on npm provides fast implementations of permutation and combination algorithms. The Stack Overflow discussion on JavaScript permutations offers several practical approaches to generating permutations in code. These topics also appear regularly on Hacker News, particularly discussions about fast algorithms for combinatorial enumeration.

Before diving into complex permutation problems, it helps to understand the two basic counting principles that underpin all of combinatorics. I've found that students who master these principles can solve most counting problems by breaking them into simpler components.

The Multiplication Principle

If you have a sequence of decisions to make, and the first has m options and the second has n options, the total number of combined outcomes is m * n. This extends to any number of decisions. If you choose an outfit from 5 shirts, 3 pants, and 4 pairs of shoes, you have 5 * 3 * 4 = 60 possible outfits. The multiplication principle is the foundation of every permutation formula.

The key requirement is independence: the number of options for each decision can't depend on the choices made for other decisions. When it does depend (like choosing 3 people in order, where each choice reduces the pool), you still multiply, but the numbers decrease: n * (n-1) * (n-2), which is exactly the permutation formula.

The Addition Principle

If you can accomplish a task by doing either activity A (which has m ways) or activity B (which has n ways), and these activities can't overlap, the total number of ways is m + n. For example, if you can travel from A to B by one of 3 trains or one of 5 buses, there are 3 + 5 = 8 ways to make the trip. This principle handles "or" situations, while multiplication handles "and" situations.

The Pigeonhole Principle

While not directly about permutations, the pigeonhole principle is one of the most useful tools in combinatorics. If you distribute n items into m containers where n > m, at least one container must hold more than one item. This simple observation has consequences. If 13 people are in a room, at least 2 must share a birth month (12 months, 13 people). If you choose 5 numbers from {1, 2,., 8}, at least two must differ by exactly 1.

Inclusion-Exclusion Principle

When counting elements that belong to at least one of several overlapping sets, inclusion-exclusion prevents overcounting. For two sets: |A union B| = |A| + |B| - |A intersect B|. This principle is important for counting derangements and for solving problems where simple multiplication or addition won't work due to overlapping categories. I consider it one of the most counting tools available.

This calculator went through rigorous original research and testing. I validated every calculation mode against Wolfram Alpha, Python's math.comb and math.perm functions (Python 3.8+), and manual calculations verified by multiple reviewers.

Edge cases were a particular focus during our testing. I verified correct behavior for n="0," r="0," r="n," and maximum values near the floating-point limit (n="170" for standard factorials). Results for large values use JavaScript's native number precision, which provides exact integers up to 2^53 and approximate values beyond that. For values exceeding safe integer range, the calculator displays results in scientific notation.

Browser compatibility was tested on Chrome 131, Firefox, Safari, and Edge across desktop and mobile devices. The calculator achieves strong pagespeed scores because all computation is client-side with no server dependencies. Mobile responsiveness was verified on screen widths from 320px to 2560px.

The factorial implementation uses a simple iterative approach rather than recursion, which avoids stack overflow issues for large inputs. For combination calculations with large n values, I implemented a multiplicative formula that avoids computing full factorials, preventing overflow for cases where the final result fits in a double but the intermediate factorial doesn't.

Last tested March 2026

• Permutation - Wikipedia
• Permutations in JavaScript - Stack Overflow
• js-combinatorics package - npmjs.com
• Counting and Probability - Khan Academy
• The Art of Problem Solving - artofproblemsolving.com