10,000
4
10,000
4
The Permutations with Replacement Calculator computes the number of ordered sequences of length r that can be formed from n types when repetition is allowed. The formula is simply n^r — each of the r positions can independently be filled with any of the n types. This is the simplest yet most widely applicable counting principle, governing everything from password strength to digital encoding.
Every time you set a combination lock, choose a PIN, or transmit a digital signal, you are working with permutations with replacement. The exponential growth of n^r explains why adding just one more character to a password or one more bit to an encryption key dramatically increases security.
The formula for permutations with replacement is:
$$\text{Permutations} = n^r$$
This follows directly from the multiplication principle (fundamental counting principle): if the first position can be filled in n ways, the second in n ways (replacement means all options remain available), and so on for all r positions, then the total number of sequences is:
$$n \times n \times n \times \cdots \times n = n^r$$
For comparison with other counting methods:
The growth of n^r is exponential in r, which is why it dominates computational complexity. A 4-digit PIN from 10 digits: 10⁴ = 10,000. An 8-character password from 95 printable ASCII characters: 95⁸ ≈ 6.63 × 10¹⁵. Each additional position multiplies the total by n.
The result represents the total number of possible sequences. For security applications, larger values mean more possibilities an attacker must try. For encoding, it determines the number of unique messages a code can represent. The log₁₀ output gives the order of magnitude — a 4-digit PIN has log₁₀ = 4.0, meaning about 10⁴ possibilities.
Inputs
Results
Each digit can be 0-9 independently, giving 10⁴ = 10,000 possible PINs. A random guess has a 1/10,000 = 0.01% chance of success. At one attempt per second, brute-forcing takes at most about 2.8 hours.
Inputs
Results
Each bit can be 0 or 1, so an 8-bit byte has 2⁸ = 256 possible values. This is why one byte can represent 256 distinct characters (the basis of ASCII encoding) or unsigned integers from 0 to 255.
Because each position in the sequence is an independent choice from all n options. There is no "using up" of items — every position has the full n options. Factorial-based formulas apply when items are consumed (no replacement). The multiplication principle directly gives n × n × ... × n = n^r. This is the simplest counting formula but produces the largest counts, reflecting the power of independent choice with unlimited repetition.
Password strength is measured by the total number of possible passwords = n^r, where n is the character set size and r is the password length. A numeric PIN (n=10, r=4) has 10,000 possibilities. A lowercase alphabetic password (n=26, r=8) has 2.09 × 10¹¹. Adding uppercase, digits, and symbols (n=95, r=12) yields 5.4 × 10²³. Each additional character multiplies the space by n, which is why length is the most important factor in password security.
In information theory, the number of possible messages using an alphabet of n symbols in sequences of length r is n^r. The information content is log₂(n^r) = r × log₂(n) bits. This is why binary (n=2) is fundamental to computing: each binary digit carries exactly 1 bit of information. A byte (r=8, n=2) carries 8 bits and encodes 256 messages. Shannon's theory uses this counting to define channel capacity and data compression limits.
Yes. Exponential growth means even modest inputs produce huge numbers. With n=26 and r=10 (10-letter words from the alphabet), the result is 26¹⁰ ≈ 1.41 × 10¹⁴ — over 141 trillion sequences. With n=100 and r=20, the result exceeds 10⁴⁰. The log₁₀ output helps interpret such large values: a log₁₀ of 40 means approximately 10⁴⁰ permutations.
DNA uses 4 nucleotide bases (A, T, C, G), so a DNA sequence of length r has 4^r possible sequences. A 20-base sequence (a typical primer) has 4²⁰ ≈ 1.1 × 10¹² possibilities. This exponential growth explains genomic diversity and is used in bioinformatics to calculate the probability of random sequence matches, design unique primers, and analyze the complexity of genetic codes.
Permutations with replacement IS the multiplication (counting) principle applied uniformly. The general multiplication principle says: if task 1 can be done in n₁ ways, task 2 in n₂ ways, etc., the total is n₁ × n₂ × ... × nᵣ. Permutations with replacement is the special case where every task has the same number of options (n₁ = n₂ = ... = nᵣ = n), giving n^r. The general principle allows different counts at each position (like a license plate with 3 letters then 4 digits).
Roboculator Team
The Roboculator Team explains calculations, planning tools, and practical formulas in clear language for real-life situations.
How helpful was this calculator?
Be the first to rate!
Lottery Odds Calculator
Probability Calculators
Probability Calculator
Probability Calculators
Conditional Probability Calculator
Probability Calculators
Monty Hall Problem Calculator
Probability Calculators
Combinations Calculator (nCr)
Probability Calculators
Permutations Calculator (nPr)
Probability Calculators
