Math1313-Section6.4-Blank

Math1313-Section6.4-Blank - Section 6.4 Permutations and...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Section 6.4 Permutations and Combinations Definition: n-Factorial For any natural number n, 1 2 3 ) 2 )( 1 ( ! = n n n n . 0! = 1 A permutation is an arrangement of a specific set where the order in which the objects are arranged is important. Formula: P ( n , r ) = )! ( ! r n n , r < n where n is the number of distinct objects and r is the number of distinct objects taken r at a time. Formula: Permutations of n objects, not all distinct Given a set of n objects in which 1 n objects are alike and of one kind, 2 n objects are alike and of another kind,…, and, finally, r n objects are alike and of yet another kind so that n n n n r = + + + ... 2 1 then the number of permutations of these n objects taken n at a time is given by ! ! ! ! 2 1 r n n n n A combination is an arrangement of a specific set where the order in which the objects are arranged is not important. Formula:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/30/2010 for the course MATH Math 1313 taught by Professor Abdelnourahmed-zaid during the Fall '10 term at University of Houston.

Page1 / 5

Math1313-Section6.4-Blank - Section 6.4 Permutations and...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online