Permutations with Replacement
Count ordered selections: n^r.
What is the Permutations with Replacement used for?
Use it to count ordered selections with repetition, like PIN codes.
When to use it
- Password and PIN strength
- Probability problems
- Code combinations
About this tool
The Permutations with Replacement works out permutations with replacement and formula from a few simple inputs. Type types n and positions r and the results update instantly as you change any number – there is no button to press and nothing to install.
How to use it: start with the example values already filled in to see how the permutations with replacement behaves, then replace them with your own figures. Every field accepts decimals, and you can change one value at a time to compare scenarios side by side.
Results are rounded for readability, so treat them as a reliable estimate rather than an official figure. Double-check important results before relying on them.
Frequently asked questions
How does the permutations with replacement work?
It uses standard formulas to turn types n and positions r into permutations with replacement and formula. The calculation reruns every time you change an input.
Is the permutations with replacement free?
Yes. The permutations with replacement on UnlimiPocket is completely free, with no sign-up, no usage limits and no watermarks.
Is my data uploaded anywhere?
No. Everything is calculated in your browser on your own device. Nothing you type or open is sent to our servers.