Permutation with repetition calculator calculates the total number of arrangements to select objects, where each object can be selected multiple times and the order of objects matters.
Permutation with Replacement calculator |
|
Total Number of Objects n | |
Size of the Selection r | |
Result: |
Permutation with repetition formula is
nPr = nr
where
n = number of objects
r = size of the selection (how many times of objects to be chosen)
Permutation with repetition is commonly used in scenarios like setting a password.
For example, if you have a 6-digit passcode for your door lock, where each digit can be any number from 0 to 9.
For each digit in the passcode:
So, for a 6-digit passcode, you multiply the choices for each position:
10 x 10 x 10 x 10 x 10 x 10 = 106 = 1,000,000
The calculation works because each digit in the passcode can be any of the 10 numbers (0-9),
and this choice is repeated for each digit.
Using the example above, if you want to create a 6-digit passcode for your door lock where each digit is different,
you would use a permutation without repetition.
This means that each digit in the passcode must be unique and can not repeat.
For each digits in the passcode:
Therefore, the total number of unique 6-digit passcodes without repetition is:
10 × 9 × 8 × 7 x 6 x 5 = 151,200
In summary, permutation with repetition allows for repeated use of digits,
increasing the number of possible combinations compared to permutation without repetition.
Terms | Privacy | Disclaimer | Contact
©2025 bCalculator