Eme

Permutations & combinations .

multiplication Theorem
(fundamental Principle of
↓
counting)
event performed
If one can be

in 'm ways I another event

can be performed in 'n ways
Total
Then ways of Doing Two

events one mxn

one
by
=

& maths Books =

misme , M3
Accounts Books =
Als 92
of If
maths accounts
are book are
of
can be selected in 3x2 = 6 ways
 # Enorial (! )
first 'n
n != Product of
natural numbers

g y ! = uX3x2x1 =
24

0!
& = 8x6X ...
3x2x1 = 40320

=
n6 = u(n 1) (n 2) (n 3)
- -
-
..... 3 2
. -
/

(2n) ! = 2n(2n 1) (2n -2)

-
...
3 2
. .
1

(n +2) ! = (n + 2)(n + 1)n(n -

1 ...
3 2 /. .
# + 22) + 3(3 !

=
) +

(n + 1)!
...
+

-
n(b)
1

& I (1 ! ) + 2(2 ! ) + 3(3 ! ) =

46-1

# Ermutations
Arrangement of elements where

order
of elements is important
elements
& : 1
,
2 , 3

permutations : 123 , 132 , 213

231 312 , 321
,
#
Total permutations of 'U'

elements when 's' elements

are used at a time

"Ou
=
=

)!

where 0181n

& Py

8
=
Py = 0x7 x6
me

u
↓
3 factors
& "Pu
o
=
= 10xx ext
mu

Y factos

# When elements
some
repeat
with prequencies Fi , F2 & F3

Then

!E!
Total
=

permutations

ALL AHA BAD

G
Total elements = 9
A - 4 >
-
2
,

=
Permutations
Total
 #Eur
permutations

Total circular permutations

>
-

elements
of 'n' = Cn-1 !

>
-
Total circular permutations
when in each
permutation
have different neighbour
our Necklace formation

!
T
Sum
>
-

of all permutations when

some
digits are given

LomotYx
=

x III. ... ie is

G Digits : 11 3, 548
numbers
sumap all I
dogit
which can be made without

repition
17xYX
=
111I

= 1 13 , 322
,
 #hibinations
Selection
of elements where
order of selection is not

important.
Elements asb, C
G
:

selection
of 2 elements
ab)ac4bC

·
& c =
# 1
(p =

#
C = 1

# =n

#
"C =

G "(n-y
#
=

#
( +
(+ =
n+

Cu +
#
37 c =
C
Then a =
b our at b = n

# (6 + hc ,
+
+(2 + .. .
+
( =
(2)
# nc + 2 + ( + ...
+
4(u =
2) -
1

# Total handshakes
in a
a person
group of =
"C
# Total Diagonals in
a
polygon with = "E -
n

U sides = n(n 3)
-

-
2
# when 'n' non collinear
Points are given
Total lines
Then =
n(
Total Triangles =
"C

# when 'n' points are given

out
of which
'm' points are

then
Collinear

Total lines =
nc 2( -
+ 1

Total triangles nCz-EC3

=