Problems this can answer
The model fits PIN-like strings, repeated dice outcomes, fixed-length codes, and ordered sampling with replacement.
Math calculator
Permutations with Repetition Calculator
Count length-n sequences when each position may reuse any available symbol. A checkable formula accompanies ordered strings instead of leaving an unexplained number.
Permutations with Repetition inputs
Known quantities
The idea behind the result
When m symbols may be reused independently in each of n ordered positions, the multiplication principle gives mⁿ possible sequences.
The calculation treats available symbols and sequence length according to their labels, not as interchangeable values in permutations with repetition.
Follow one set of numbers
Six symbols across four positions produce 6⁴=1,296 sequences because every one of the four stages has six choices.
Reproducing the answer
Draw one slot for each position, write m choices above every slot, and multiply the equal stage counts. Permutations with Repetition also leads to unequal stage counts.
Mistakes worth catching
Reuse and order are both essential assumptions. If symbols cannot repeat or if order does not matter, another counting formula is required. If the Permutations with Repetition assumptions do not fit, consider unordered repeated selection.
Changing only one field helps distinguish a data-entry problem from the intended behavior of permutations with repetition.
How the inputs shape the output
A field name is part of the formula. Match the problem's quantities to available symbols and sequence length, then check that they share the scale assumed by the permutations with repetition relationship.
How the result responds
Adding one position multiplies the result by m; adding a symbol changes the choice count at every position. This is a stronger check than judging the answer only by how many decimal places it shows.
Combinations with repetition permit reuse but ignore order, producing a much smaller count. The formula panel makes the chosen definition explicit.
Recording the answer
Match the reported precision to available symbols and sequence length, not to the number of digits the browser can display. Preserve an exact form when it communicates the permutations with repetition structure more clearly than a decimal.
The minimum audit trail is short: available symbols and sequence length, their units, and the formula beside the answer. It is enough to distinguish this calculation from a similar-looking shortcut.
What can change the Permutations with Repetition answer
Before carrying a Permutations with Repetition result into later work, vary one of Available symbols, Sequence length and predict whether the answer should rise, fall, or remain unchanged. This sensitivity check is especially useful when similar fields represent totals, successes, intersections, or conditioning events.
For Permutations with Repetition, a surprising response should trigger a model review before a rounding change. Confirm independence, replacement, event orientation, and row numbering in the source problem, because arithmetic cannot repair a sample space defined incorrectly.
Questions about Permutations with Repetition
Does order matter?
Yes.
May a symbol be reused?
Yes.
What if the sequence length is zero?
There is one empty sequence.
Why is the answer a power?
The same number of choices repeats at every position.