Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
228 views

Permutation and Combination Note

Permutation and combination are methods of arranging objects. Permutation considers order important and is calculated as n!, while combination ignores order and is calculated as n!/(n-r)!r!. The document defines the formulas for calculating the number of permutations and combinations of objects.

Uploaded by

wandyinfinity
Copyright
© Public Domain
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
228 views

Permutation and Combination Note

Permutation and combination are methods of arranging objects. Permutation considers order important and is calculated as n!, while combination ignores order and is calculated as n!/(n-r)!r!. The document defines the formulas for calculating the number of permutations and combinations of objects.

Uploaded by

wandyinfinity
Copyright
© Public Domain
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Permutation and Combination

Permutation Combination
 The order of arrangement is
 The order of arrangement is not
important.
important.
 The number permutation of n
 The number of combination of r
different object is given by ⬚𝑛 𝑝𝑛 =
object chosen from n different
n!
object given by
= n(n – 1)(n – 2)… 3.2.1 Multiplication Rule 𝑛!
 The number of permutation of n ⬚𝑛 𝑐𝑟 =
𝑛 − 𝑟 ! 𝑟!
different object taken r at time is 𝑛 𝑛−𝑟 𝑛−2 … 𝑛−𝑟+1
given by =
𝑟 𝑟 − 1 𝑟 − 2 … . 3.2.1
𝑛!
⬚𝑛 𝑝𝑟 =
𝑛−𝑟 !
=𝑛 𝑛−1 𝑛−2 … 𝑛−𝑟+1

Wandy

You might also like