`P_r(n) = "n" ^ "r" `

Enter a value for all fields

The Permutations with Repetitions calculator computes the number of permutations possible in a set of r elements from a finite set of n objects where different orders create different permutations (i.e. where order is important) and repetitions are possible. 

INSTRUCTIONS: Enter the following:

• (n) The total number of objects in the circle.
• (r) The size of the subset 

Permutations with Repetitions: The calculator computes and return the number of permutations with repetitions  P_r(n).

The Math

The formula for permuations with repetitions is as follows:

                    P_r(n) = n^r

You have n things to choose from each time you make one of the r choices, where r is a subset of n.

Combinatorics Calculators

• n! - factorial
• `n!  sqrt(2 pi n) (n/e)^n ` - Stirling's factorial approximation
• _nC_k - combinations
• C_r(n,k) - combinations with repetitions
• _nP_k - permutations
• P_r(n) - permutations with repetitions
• P_comp(n,2) - Comparison permutations
• P_c(n,r) - Circular Permutation