Overview
When items can be reused, the number of possible sequences is the number of choices raised to the length. That's how PIN codes, license plates and passwords are counted.
Enter the number of symbols available and the sequence length.
Worked examples
| Inputs | Result |
|---|---|
| Number of Symbols (n)10Sequence Length (r)6 | Permutations with repetition: 10^6 = 1,000,000 |
Show 3 more examples
| Number of Symbols (n)10Sequence Length (r)4 | Permutations with repetition: 10^4 = 10,000 |
| Number of Symbols (n)26Sequence Length (r)3 | Permutations with repetition: 26^3 = 17,576 |
| Number of Symbols (n)2Sequence Length (r)8 | Permutations with repetition: 2^8 = 256 |
Permutations with repetition by sequence length
With the calculator's starting values, the permutations with repetition is 1,000,000. The table shows how it changes with the sequence length.
| Sequence Length (r) | Permutations with repetition |
|---|---|
| 3 | 1,000 |
| 4 | 10,000 |
| 5 | 100,000 |
| 6starting value | 1,000,000 |
| 7 | 10,000,000 |
| 8 | 100,000,000 |
| 9 | 1,000,000,000 |
Other inputs: Number of Symbols: 10 n. Change them in the calculator above for your own numbers.
How it works
Each position can be any of the n symbols, independently of the others, so the count is n multiplied by itself r times.
The formula
| n | Number of symbols |
| r | Length of the sequence |
Practical tips
- A 6-digit code has 10⁶ = 1,000,000 possibilities.
- A 4-digit PIN has 10,000, so one random guess has a 1 in 10,000 chance.
- 26 letters in a 3-letter sequence give 17,576 options.
Frequently asked questions
How is this different from permutations without repetition?
Without repetition, each item can only be used once, so the count is smaller.
Is this a combination lock?
Yes. Despite the name, lock codes are ordered sequences with repetition.
How big can the numbers get?
Very big results lose exact precision, so treat them as approximate above about 9 quadrillion.