permutation
1. An ordering of a certain number of elements of a given set. For instance, the permutations of (1,2,3) are (1,2,3) (2,3,1) (3,1,2) (3,2,1) (1,3,2) (2,1,3). Permutations form one of the canonical examples of a "group" - they can be composed and you can find an inverse permutation that reverses the action of any given permutation. The number of permutations of r things taken from a set of n is n P r = n! / (n-r)! where "n P r" is usually written with n and r as subscripts and n! is the factorial of n. What the football pools call a "permutation" is not a permutation but a combination - the order does not matter. 2. A bijection for which the domain and range are the same set and so f(f' (x)) = f' (f(x)) = x. (2001-05-10) In addition suitable contents:
[ 2 ] [ = ] [ actor ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ ba ] [ be ] [ bi ] [ bijection ] [ bs ] [ ca ] [ canonical ] [ ch ] [ co ] [ com ] [ combination ] [ cr ] [ de ] [ do ] [ domain ] [ du ] [ ec ] [ ed ] [ element ] [ er ] [ es ] [ et ] [ fact ] [ factor ] [ factorial ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ge ] [ gi ] [ gr ] [ group ] [ gs ] [ h ] [ hat ] [ hing ] [ hr ] [ id ] [ il ] [ in ] [ instance ] [ inverse ] [ io ] [ is ] [ it ] [ ke ] [ ken ] [ Lex ] [ ls ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ nu ] [ om ] [ ordering ] [ pe ] [ ph ] [ pl ] [ pt ] [ query ] [ range ] [ rc ] [ re ] [ ro ] [ sa ] [ sam ] [ sc ] [ script ] [ se ] [ set ] [ so ] [ st ] [ su ] [ T ] [ th ] [ to ] [ tt ] [ ua ] [ um ] [ up ] [ us ] [ ve ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3751 Reads) |
