Permutations with Repetition Calculator

About Permutations with Repetition Calculator

The Permutations with Repetition Calculator computes the number of ordered arrangements when items can be selected more than once, using the formula n^r. Enter the number of available items (n) and the number of positions to fill (r) to instantly get the total count, a step-by-step solution, an interactive slot-machine visualization, comparisons with other counting methods, growth tables, and real-world analogies. This tool supports both small and astronomically large values.

What Are Permutations with Repetition?

Permutations with repetition (also called ordered arrangements with replacement or r-tuples) count the number of ways to fill r ordered positions using n distinct items, where each item may be used any number of times. The result is n^r because each of the r positions independently has n choices.

For example, creating a 4-digit PIN code from digits 0–9: each of the 4 positions can be any of 10 digits, giving 10⁴ = 10,000 possible PINs. The code "1111" is valid (all positions use the same digit), and "1234" is different from "4321" (order matters).

The Formula: n^r

The formula follows directly from the multiplication principle (also called the fundamental counting principle):

• Position 1 has n choices
• Position 2 has n choices (items can repeat)
• Position 3 has n choices
• … and so on for all r positions

Total arrangements = n × n × n × … × n (r times) = n^r

Permutations with Repetition vs. Other Counting Methods

There are four main counting formulas in combinatorics. Understanding when to use each one depends on two questions: Does order matter? and Can items repeat?

• Permutations with repetition (n^r) — order matters, repetition allowed. Example: PIN codes, passwords.
• Permutations without repetition (n!/(n−r)!) — order matters, no repetition. Example: race finishing positions.
• Combinations without repetition (C(n,r) = n!/(r!(n−r)!)) — order doesn't matter, no repetition. Example: lottery draws.
• Combinations with repetition (C(n+r−1,r)) — order doesn't matter, repetition allowed. Example: choosing scoops of ice cream.

Common Real-World Applications

• PIN Codes and Passwords: A 4-digit PIN using 0–9 has 10⁴ = 10,000 possibilities. An 8-character password using 62 characters (a–z, A–Z, 0–9) has 62⁸ ≈ 218 trillion possibilities.
• Binary Strings: An 8-bit byte has 2⁸ = 256 possible values. A 32-bit integer has 2³² ≈ 4.3 billion values.
• Dice Rolls: Rolling a standard 6-sided die 3 times gives 6³ = 216 possible outcome sequences.
• License Plates: A plate with 6 alphanumeric positions using 36 characters gives 36⁶ ≈ 2.18 billion unique plates.
• Multiple Choice Tests: A 20-question test with 4 options per question has 4²⁰ ≈ 1.1 trillion possible answer sheets.
• Genetic Sequences: DNA sequences of length r using 4 nucleotides (A, T, C, G) have 4^r possible sequences.

Why n^r Grows So Fast

Exponential growth is extremely powerful. Even small increases in n or r lead to enormous results:

• Doubling r squares the result: n^2r = (n^r)²
• Adding 1 to r multiplies the result by n: n^r+1 = n × n^r
• This is why longer passwords are exponentially more secure — each extra character multiplies the search space by n

Special Cases

• n⁰ = 1 — There is exactly one way to fill zero positions: do nothing (the empty arrangement).
• n¹ = n — Filling one position simply means choosing one of n items.
• 1^r = 1 — If there is only one item, every position must use it, giving one arrangement.
• 2^r — Binary strings of length r. This equals the number of subsets of an r-element set.

How to Use This Calculator

1. Enter n, the total number of distinct items available to choose from (e.g., 10 for digits 0–9, 26 for letters A–Z).
2. Enter r, the number of positions or slots to fill. Each position can use any of the n items, including items already used elsewhere.
3. Click "Calculate Permutations" to compute the result.
4. Review the step-by-step solution, slot visualization, comparison table, growth charts, and real-world analogies.
5. Use the quick scenario buttons to explore common real-world examples.

Frequently Asked Questions

What are permutations with repetition?

Permutations with repetition are ordered arrangements where each item can be selected more than once. The formula is n^r, where n is the number of items to choose from and r is the number of positions to fill. For example, a 4-digit PIN code using digits 0–9 has 10⁴ = 10,000 possible arrangements.

What is the difference between permutations with and without repetition?

In permutations without repetition, once an item is used it cannot be used again, giving n!/(n−r)! arrangements (and requiring r ≤ n). With repetition, each item can be reused in any position, giving n^r arrangements. Permutations with repetition always produces a larger or equal result because there are no restrictions on reuse, and r can exceed n.

When should I use permutations with repetition?

Use permutations with repetition when (1) order matters (the arrangement ABC is different from CBA) and (2) items can be reused (the same item can appear in multiple positions). Common examples include PIN codes, passwords, dice rolls, license plates, binary strings, and genetic sequences.

Can r be larger than n?

Yes. Unlike permutations without repetition (which requires r ≤ n), permutations with repetition allows r to be any non-negative integer. A 10-character password drawn from 26 letters (r = 10, n = 26) has 26¹⁰ ≈ 141 trillion possibilities.

What is the formula for permutations with repetition?

The formula is n^r (n raised to the power r), where n is the number of distinct items available and r is the number of positions to fill. This follows from the multiplication principle: each of the r positions has n independent choices, so the total is n × n × … × n (r times).