Permutation of Objects The number of ways n distinct objects can be ordered is n!., \) ]1 f& Z* l! X8 w. q
Example:
4 D+ ^0 j7 V1 i3 a8 @$ n- ~' M Number of ways 6 people can from a queue is 6!.! X# A" y* q% a2 z0 [% ?0 A) b
Number of ways 5 different cars can be parked in 5 parking spaces is 5!.
8 T4 X7 f- N s Remember:0 o, I* h, g+ j& J) A: b
This does not apply if there are identical objects or ordering does not matter.
$ g) ?" \! {6 r9 ]: N! S Permutation with Selection1 I! f9 M4 f1 D% o" S
The number of ways n objects drawn from a collection of m distinct objects can be ordered is m!/(m-n)!.
p. A; T9 { g G. \ Example:
0 F( J1 k2 s2 V Number of ways a queue of length 3 can be formed from a group of 5 people is 5!/(5-3)!=5!/2!=5*4*3=60.! c: i0 t% n; \: j: b# r+ F* Y
Number of possible top ten list for 150 movies is 150!/(150-10)!.: I. @6 H1 p, R( U& x$ g
Remember:
c4 a: o0 R) m( P; e2 _ This does not apply if there are identical objects or ordering does not matter |