click the calculate button
A Permutations is a selection of items (sample) from a collection in a sequential order.
For example, given four letters: A, B, C and D there are twelve permutations of two that can be drawn from this collection:
Thus, the number of possible permutations of 2 samples from a 4 item collection is 12.
Unlike combinations, permutations consider that the order of the sample is relevant.
The formula for permutations is: C(n,k) = n! / (n-k)! Where n is the collection size and k is the sample size.
For more info on Permutations: https://en.wikipedia.org/wiki/Permutation