PERMUTATIONS WITHOUT REPITITION
Given a set of n elements, the permutations with repetition are different groups formed by the k elements of a subset such that:
The order of the elements does matter.
The elements are repeated.
The permutations with repetition are denoted by PR(n,k)=n^k
The order of the elements does matter.
The elements are repeated.
The permutations with repetition are denoted by PR(n,k)=n^k