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) N="left">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 - (3858 Reads) |
