Professional Documents
Culture Documents
PROBLEM 1: AND =
SOLUTION: 0R AND
PROBLEM 2:
SOLUTION AND OR
PROBLEM 3:
How many 3 digit numbers begin with a 3 or 4 ?
SOLUTION: AND = X
Digits :
Beginning with 3
ADDITION PRINCIPLE
MULTIPLICATION PRINCIPLE
n 1 n2 n3 ...nk
EXAMPLE 5.1
SOLUTIONS
() or ( ) or ()
COUNTING FORMULAE
N = 10 K = 3
N= k=
(c ) Contain either Mary or Peter?
Mary: N=
Peter: N=
TOTAL =
PROBLEMS:
OR
2 (a) A
THE BINOMIAL EXPANSION ( a b) n
n=0 ( a b) 0
n=1 ( a b)1
n=2 ( a b) 2 1a^2 + 2
n=4 ( a b) 4
GENERAL FORMULA
There are: n!
( n1 ! n2 ! n2 !...
EG2: ABRACADABRA
EXAMPLE 5.5
Find:
(a) The coefficient of 3 2 4 in the
x y z
C(9, 6) =
PROBLEM 5.1
4) Combination
Players, Jury,
5) Rearrangeme
(X) OR = (+)
der matters
9 possibilities
Order matter
6 possiblities
Order does not matter
3 possibilities
C(12, 5) =
5 MEMBER COMMITTEE
B–A
k=
+
k=
A–B B–A
n n!
C ( n, k ) nCk
k ( n k )! k !
1
1a + 1b
C(5,0) C(5,1)
1
nC2a n 2b 2 nC3a n3b 3... nCn a 0b n
EG1: REARRANGE
n!
n2 !... nk ! samuel = 6!
RACADABRA A= EG3:
B=
R=
s be divided into three tutorial groups, with 5
ch group studies a different topic?
2 4
y z in the expansion of ( x + y + z )9
9
in the expansion of ( x + y) a)
b)
c)
d)
PSYCHOLOGY
T IS THE FRIST AND LAST 3 DIGIT NUMBER
LAST
C,….., Z
What is a straight Line Permutation?
n!
7! =
10 couples in line
20!
Circular Table (n - 1)!
n k 32 9
n ! 3! 3 2 1 6
n! 3!
P ( n, k ) n
Pk
(n k )! (3 2)
n! 3!
P ( n, k ) n
Pk
(n k )! (3 2)
n = 10 k = 3
n!
C ( n, k ) Ck
n
(n k )!k! (3
C(N, K) = C(N, R)
B–A
possible?
Combination /Binomial
C(0, 0)
C(1,0) C(1, 1)
C(2, 0) C(2, 1)
REARRANGEMENT R =
E =
A =
N =
EG3:TOMORROW
O=
R=
x4 y 4 in ( x y )8
x16 y 3 in ( x y )19
x 70 y 30 in ( x y )100
x 70 y 30 ( x y )100
x 47 y 3 in ( x y )50
N! 4 L, 5 G = 9!
(N - 1)! (9 - 1)!
N! 9X8X7X…X1
(N - k)!
N! 10 : 1ST, 2ND, 3RD
(N - k)!k!
N! 10!
N1! N2!....N4! 2! 2!
0 0 300
1 1
2 2
3 3
3 4 4
5 5
6 6
7 7
8 8
9 9
1 10 10
mutation?
1 6
n! 3!
6
(n k )! (3 2)!
n! 3!
6
(n k )! (3 2)!
n! 3!
3
(n k )!k! (3 2)!2!
nomial Pascal Triangle
(a + b)^n
C(2, 2) 1
1
1 4
1 5
1 C(0, 0)
1 1 C(1, 0) C(1, 1)
2 1 C(2, 0) C(2, 1)
3 3 1 C(3, 1) C(3, 2)
6 4 1 C(4, 1) C(4, 2)
10 10 5 1
C(1, 1)
C(2, 1) C(2, 2)
C(3, 2) C(3, 3)
C(4, 2) C(4, 3) C(4, 4)