Permutation Combinations formula
n! =1×2×3×....×(n-2)(n-1)n
principle of addition
if an event can occur either in m or n mutually exclusive alternate ways than the total number of ways in which the event can occur is m+n
Principle of multiplication
if an event has impossible outcomes and another independent event has and possible outcomes then there are m full stop and possible outcomes for the two events together
Permutation
A) permutation is an arrangement in a definite order of a number of objects taken some or all at a time linear permutation a the permutation of n different objects taken at a time when reputation of objects in the permutation is not allowed is given by
`nPr=\frac{n!}{(n-1)!} , r<=n`
B) the of permutations of n different objects taken are objects at a time when repetition of objects in the permutation is allowed is given by `n^r`
C) The number of permutations of `n` objects when `p` objects are of one kind `q` objects of are of second kind are objects are of third kind and the rest if any `r` of different kind is
`\frac{n!}{p!q!r!}`
Circular Permutation
the arrangement in a circle are called circular arrangement read the number of circular permutation of n different object equal to n -1 be the number of ways in which things of which we are alike can be arranged in a circular order is and -1 p combination a combination is a selection total number of selection of n different objects taken R at a time is denoted by nCr or nCr or and is given by
nCr=`nPr=\frac{n!}{(n-1)!} , r<=n`
=`\frac{nPr}{r!}`
![]() |
| Permutation Combinations formula |
Permutation Combinations formula




