Quick guide
How to use this calculator
- Enter the number of available symbols n.
- Enter the number of ordered positions r.
- Read the exact number of strings.
Calculation method
Apply the product rule to every position
Each of r positions independently has n choices, so the count is n raised to r.
Worked example
Four-digit strings
Ten digits may be reused in each of four positions.
10⁴ = 10,000
Supported inputs
Precision and limits
Discrete domain
Inputs are whole counts. Negative, fractional, grouped, and scientific-notation inputs are rejected.
Exact integers
Results use arbitrary-precision integers and are never rounded. Inputs and output size are bounded to keep the page responsive.