Understanding Permutation with Repetition
A permutation is any ordered arrangement of items from a given collection. When repetition is permitted, the same object can appear multiple times within a single arrangement.
Consider a 4-digit PIN using digits 0–9. You could create pins like 3242 or 4555, where digits repeat. Without restriction on reuse, the first digit has 10 choices, the second digit again has 10 choices, and so on. This freedom to reuse elements is what distinguishes permutation with repetition from its counterpart.
Real-world examples include:
- Password creation where characters can repeat
- License plate generation with mixed alphanumeric codes
- Lottery ticket sequences using available numbers
- Security codes and access systems
Permutation with Repetition Formula
When selecting r items from n available objects and repetition is allowed, the total number of possible arrangements follows a straightforward exponential relationship.
nPr = nr
n— Total number of distinct objects available for arrangementr— Number of positions or selections to fill in each arrangement<sup>n</sup>P<sub>r</sub>— Total number of possible permutations with repetition allowed
Worked Example: Alphanumeric Passwords
Suppose you need to determine how many 10-character passwords are possible using both uppercase and lowercase English letters plus the digits 0–9.
Step 1: Count available characters
- Uppercase letters (A–Z): 26
- Lowercase letters (a–z): 26
- Digits (0–9): 10
- Total available: 26 + 26 + 10 = 62 characters
Step 2: Apply the formula
With 62 characters available and 10 positions to fill:
62P10 = 6210 = 839,299,365,868,340,224
This yields over 839 quintillion unique passwords—a testament to why repetition dramatically expands the solution space.
Practical Considerations
When working with permutation with repetition, several real-world factors deserve attention.
- Distinguish repetition types — Ensure clarity about whether your problem allows items to repeat. If a PIN must use four different digits, use permutation without repetition instead. Confusing the two produces vastly different answers.
- Large numbers escalate quickly — Even modest values of n and r produce enormous results. A 6-digit password from 62 characters already exceeds 56 trillion combinations. Always check whether your calculated figure makes practical sense for the context.
- Watch for computational limits — Very large exponents can exceed typical calculator precision. Some tools express answers in scientific notation (mantissa and exponent form) to handle numbers beyond standard display ranges.
- Order matters in permutations — Permutations care about sequence: 1234 and 4321 are different arrangements. If you only care about which items are selected (not their order), use combinations with repetition instead.
When to Use This Calculator
Apply this tool whenever you need to count ordered arrangements where elements can be reused. Common scenarios include:
- Security: Determining password strength or PIN complexity
- Logistics: Assigning coded identifiers with repeating patterns
- Probability: Finding sample spaces for experiments with replacement
- Design: Creating reference systems like license plates or product codes
Simply input the total number of objects (n) and the number of positions to fill (r), and the calculator instantly reveals the number of possible distinct arrangements.