Permutations with Repetition Calculator

An SEO-optimized tool to easily calculate permutations with repetition allowed (n^r).

Total Possible Permutations

10,000

Formula: n^r = 10⁴

Results copied to clipboard!

Result Growth Visualization

Chart showing how the total permutations grow as ‘r’ (number of items to choose) increases, for a fixed ‘n’.

In-Depth Guide to Permutations with Repetition

What is a Permutation with Repetition?

A permutation refers to an arrangement of items in a specific order. When we talk about permutations with repetition (also known as permutations with replacement), we mean that we can select the same item more than once. The order of selection still matters, but the pool of available choices remains the same for every selection. This is a fundamental concept in combinatorics, the branch of mathematics focused on counting.

Think about creating a passcode for your phone. If your code is 4 digits long, you can use the same digit multiple times (e.g., ‘1122’). For the first digit, you have 10 choices (0-9). For the second, you still have 10 choices, and so on. This scenario is a perfect example of permutations with repetition and is a key area to calculate permutations with letter uses more than once or with numbers.

The Formula to Calculate Permutations with Repetition

The formula for permutations with repetition is beautifully simple and powerful. It is expressed as:

P = n^r

This formula allows you to easily calculate permutations with letter uses more than once or any similar scenario.

Variable Explanations

Variable	Meaning	Unit	Typical Range
P	The total number of possible permutations.	Unitless (a count)	Positive integer
n	The total number of distinct items to choose from.	Unitless (a count)	Positive integer (e.g., 26 for English alphabet letters)
r	The number of items being chosen or positions to fill.	Unitless (a count)	Positive integer

Practical Examples

Example 1: Combination Lock

Imagine a combination lock with 3 dials, each with numbers from 0 to 9.

• Inputs: Total distinct items (n) = 10 (digits 0-9), Number of items to choose (r) = 3 (dials).
• Calculation: P = 10³
• Result: There are 1,000 possible combinations (from 000 to 999).

Example 2: DNA Sequences

A DNA sequence is built from four nucleotide bases (A, C, G, T). How many unique DNA sequences of length 5 are possible?

• Inputs: Total distinct items (n) = 4 (the four bases), Number of items to choose (r) = 5 (the length of the sequence).
• Calculation: P = 4⁵
• Result: There are 1,024 possible DNA sequences of length 5. For a more complex calculation, you might use our Combination Calculator.

How to Use This Permutations with Repetition Calculator

1. Enter ‘Total Items (n)’: Input the number of unique options you have for each choice. For the English alphabet, this would be 26.
2. Enter ‘Items to Choose (r)’: Input how many choices you are making. For a 6-character password, this would be 6.
3. View the Result: The calculator automatically updates, showing the total number of permutations in the results area.
4. Interpret the Values: The intermediate values show the formula with your specific numbers, making it easy to understand how the result was derived.

Key Factors That Affect Permutations

• Base Number (n): This is the most critical factor. Even a small increase in ‘n’ will dramatically increase the total permutations, as it is the base of the exponential calculation.
• Exponent Number (r): The number of selections also significantly impacts the result. Each additional selection multiplies the total possibilities by ‘n’.
• Order Matters: Remember, this is a permutation. The arrangement ‘123’ is different from ‘321’. If order doesn’t matter, you need to use a combination formula. Our site has a Factorial Calculator that can be helpful for those calculations.
• Repetition is Allowed: This is the core assumption. If items cannot be repeated, the formula changes to n! / (n-r)!.
• Distinctness of Items: The ‘n’ value assumes all items are distinct (e.g., A is different from B).
• Independence of Choices: The choice for one position does not affect the available choices for another position.

Frequently Asked Questions (FAQ)

1. What’s the difference between a permutation and a combination?

The key difference is order. In permutations, the order of the items matters (e.g., ‘AB’ is different from ‘BA’). In combinations, order does not matter (‘AB’ is the same as ‘BA’).

2. What if repetition is NOT allowed?

If repetition is not allowed, you use the standard permutation formula: P(n,r) = n! / (n-r)!. You would use a different tool, like a standard permutation calculator for that.

3. Why is the formula n^r?

For the first position, you have ‘n’ choices. Since you can repeat items, for the second position, you still have ‘n’ choices. This continues for all ‘r’ positions. To find the total possibilities, you multiply the number of choices for each position together: n * n * n * … (‘r’ times), which is n^r.

4. Can ‘r’ be larger than ‘n’?

Yes. Since you can reuse items, you can make more selections than there are unique items. For example, you can create a 10-digit number (r=10) using only the digits 1 and 2 (n=2).

5. Are the inputs and outputs unitless?

Yes. Permutations are a count of arrangements, so the numbers do not have units like feet or kilograms. They are pure numbers.

6. What are some real-world applications?

This calculation is used everywhere: cryptography (possible passwords), computer science (data structures), biology (genetic sequences), and probability theory (calculating outcome spaces).

7. What is the permutation if r=0?

If you choose 0 items, there is only one way to do that: by choosing nothing. Mathematically, any number to the power of 0 is 1, so n⁰ = 1.

8. How do I handle very large numbers?

This calculator uses standard JavaScript numbers, which can handle results up to about 10³⁰⁸. For numbers larger than that, you would need specialized software that can handle arbitrary-precision integers. The principles to calculate permutations with letter uses more than once remain the same.