  thumb|120 px|each of the six rows is a different permutation of three distinct balls in mathematics, 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. the study of permutations of finite sets is a topic in the field of combinatorics. permutations occur, in more or less prominent ways, in almost every area of mathematics. they often arise when different orderings on certain finite sets are considered, possibly only because one wants to ignore such orderings and needs to know how many configurations are thus identified. for similar reasons permutations arise in the study of sorting algorithms in computer science. the number of permutations of n distinct objects is n&nbsp;factorial usually written as , which means the product of all positive integers less than or equal to n. in algebra and particularly in group theory, a permutation of a set s is defined as a bijection from s to itself. that is, it is a function from s to s for which every element occurs exactly once as an image value. this is related to the rearrangement of the elements of s in which each element s is replaced by the corresponding f(s). the collection of such permutations form a group called the symmetric group of s. the key to this group's structure is the fact that the composition of two permutations (performing two given rearrangements in succession) results in another rearrangement. permutations may act on structured objects by rearranging their components, or by certain replacements (substitutions) of symbols. in elementary combinatorics, the k-permutations, or partial permutations, are the ordered arrangements of k distinct elements selected from a set. when k is equal to the size of the set, these are the permutations of the set.  ==history== the rule to determine the number of permutations of n objects was known in indian culture at least a
Factorial_and_binomial_topics Permutations