Permutation with Replacement Calculator

What are Permutations with Replacement?

Permutations with replacement (also called permutations with repetition) count the number of ways to choose a sample of r elements from a set of n distinct objects where order matters and elements can be chosen more than once. The formula is PR(n,r) = n^r, making it one of the simplest yet most powerful counting principles in combinatorics.

The Permutation with Replacement Calculator computes n^r for any non-negative integers n and r. This is different from standard permutations (nPr) where elements cannot be reused, and from combinations where order does not matter.

The Mathematics Behind Permutations with Replacement

When selecting r items from n types with replacement allowed and order mattering, each of the r positions can be filled in n independent ways. By the multiplication principle, the total number of possibilities is n multiplied by itself r times: n^r.

For example, consider creating a 3-letter word from a 4-letter alphabet {A, B, C, D} where letters can repeat. The first letter can be any of 4, the second any of 4, and the third any of 4, giving 4³ = 64 possible words.

Understanding When to Use This Formula

Use permutations with replacement (n^r) when:

Order matters: Different sequences are considered distinct
Replacement is allowed: The same element can be chosen multiple times
Example scenarios: Rolling dice, creating PIN codes, password generation, choosing with replacement from a set

Examples of Permutations with Replacement

Here is a comparison table showing different n and r values:

n (Choices)	r (Selections)	PR(n,r) = n^r	Example
10	4	10,000	4-digit PIN codes
26	3	17,576	3-letter codes (A-Z)
6	3	216	Rolling 3 dice
2	10	1,024	10-bit binary sequences

Frequently Asked Questions

What is the difference between permutations with and without replacement?

Permutations without replacement (nPr) use the formula n!/(n-r)! and cannot reuse elements. Permutations with replacement (n^r) allow elements to be chosen multiple times. For example, choosing 2 letters from {A, B, C}: without replacement gives P(3,2) = 6 arrangements, while with replacement gives 3² = 9 arrangements including AA, BB, and CC.

When should I use permutations with replacement vs combinations with replacement?

Use permutations with replacement (n^r) when the order of selection matters, such as PIN codes or passwords. Use combinations with replacement (stars and bars) when order does not matter, such as choosing 3 scoops of ice cream from 5 flavors where flavor can repeat but the order of scoops does not matter.

How is this used in probability and statistics?

Permutations with replacement are fundamental in probability for counting equally likely outcomes when sampling with replacement. They appear in bootstrap resampling, multinomial distributions, and calculating probabilities of sequences in repeated independent trials.

What happens when r = 0 in n^r?

When r = 0, n⁰ = 1 for any n (including n = 0). This follows the mathematical convention that any number raised to the power of 0 equals 1. This represents the single way to choose nothing from a set.

What is the difference between this and the standard Permutation and Combination Calculator?

The standard permutation calculator computes P(n,r) = n!/(n-r)! where elements cannot be reused. This calculator computes n^r where elements can be reused any number of times. Both consider order important, but they differ in whether replacement is allowed.

Report

What are Permutations with Replacement?

The Mathematics Behind Permutations with Replacement

Understanding When to Use This Formula

Examples of Permutations with Replacement

Frequently Asked Questions

Related Tools

Recent Visits