# Permutation ( k-permutations of n)

## Description

Informally, a permutation of a set of objects is an arrangement of those objects into a particular order. The notion of permutation relates to the act of rearranging, or permuting, all the members of a set into some sequence or order (unlike combinations, which are selections of some members of the set where order is disregarded). For example, written as tuples, there are six permutations of the set {1,2,3}, namely: (1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), and (3,2,1). As another example, an anagram of a word, all of whose letters are different, is a permutation of its letters.

k-permutations of n are the different ordered arrangements of a k-element subset of an n-set ( sequences without repetition).

## Variables

P | k-permutations of n (dimensionless) |

n | number of trials (dimensionless) |

k | number of successes (dimensionless) |