Dms Set - 1 Counting

CONTENTS
Topic
Combinatorics
Key
DISCRETE MATHEMATICS
Page No
1 19
19 22
COMBINATORICS
1. Permutations and Combinations
Sum Rule : If X is union of disjoint non-empty subsets S1, S2,.,Sn then
|X| = |S1| + |S2| + .+ |Sn|
1. If E1, E2,.,En are mutually exclusive events and E1 can happen in e1 ways, E2 can
happen in e2 ways,.,En can happen in en ways then E1 or E2 or En can happen in
e1 + e2 +..+ en ways.
2. If an object can be selected from first box in e1 ways second box in e2 ways,nth box
in en ways then selection of one object can be done from n boxes in e 1 + e2 + . + en
ways.
Product rule : If S1, S2,.,Sn are non-empty sets, then
|S1 S2 . Sn| =
i 1
| Si |
1. If events E1, E2,.,En can happen in e1, e2,,en ways respectively then E1 first,
followed by E2,. Followed by En can happen in e1 e2 . en ways.
2. If first object can be chosen in e1 ways second object in e2 ways,nth object in en
ways then a choice of a first, second,., and an nth object can be made in e 1 e2 .
en ways.
Rule of Quotient : The rule of quotient states that when a set S is partitioned into equalsized subsets of m elements each, there are
|S|
m
subsets.
1. If equivalence classes of an equivalence relation on a finite set S has m elements, then

there are
|S|
m
equivalence classes.
Combination : A combination of n objects taken r at a time (r combination of n

objects) is an unordered selection of r of the objects.
Permutation : A Permutation of n objects taken r at a time (r Permutation of n objects)
is an ordered selection of r of the objects.
Linear permutation : Objects arranged in aline
r-Permutation of n objects without repetition : P(n, r) or n Pr

1.
Pr
2.
Pr = n!
n!
( n r )!
Circular Permutation : Objects arranged in a circle (preference will be given relative to

the position)
1. Number of circular permutations of n objects = (n 1)!
2. Number of circular permutations of n objects in clockwise direction =
( n 1)!
2
3. Number of circular permutations of n objects in anti-clockwise direction =
( n 1)!
2
Number of r-combinations without repetitions : C(n, r) or n C r

n
Cr
Pr
r!
n!
r !( n r )!
Restricted Permutation : Number of permutation of n objects taken r at a time in which

m particular objects are
1. never included will be P(n m, r)
2. always included will be C(n m, r m) P(r, r)
Restricted Combinations : Number of combinations of n objects taken r at a time in
which m particular objects are
1. never included in C(n m, r) ways
2. always included in C(n m, r m) ways
Number of r-permutation of n objects with unlimited repetition : U(n, r) = nr
Number of r-combinations of n-objects with unlimited repetitions : V(n, r)
= Number of non-negative integral solutions to x1 + x2 + .+ xn = r
= The number of ways of distributing r similar balls into n numbered boxes
= The number of binary numbers with (n 1) ones and r zeros
= C(n 1 + r, r)
= C(n 1 + r, n 1)
=
( n 1 r )!
r !( n 1)!
Constrained repetitions : Suppose q1, q2,.,qt are non-negative integers

n = q1 + q 2 + + qt. Suppose a1, a2,..,at are t objects
P(n: q1, q2,.,qt) number of n-permutations in which q 1 are alike (a1 s), q2 are alike
(a2 s).,qt (at s) are alike, then
P(n ; q1, q2,.,qt) =
n!
( q1 )! ( q 2 )! ....( qt )!
Ordered Partitions : The number of ordered partitions of a set S of type (q1, q2,.,qt)
where |S| = n is
P(n ; q1, q2,.,qt) =
n!
( q1 )! ( q 2 )! ....( qt )!
Unordered partition : The number of unordered partition of equal cell size. Let S be a
set with n elements (n = q.t). Then number of unordered partition partitions of S of type
(q, q, .q) is
n!
t ! ( q! ) t
Pigeonhole Principle : If n pigeonholes are occupied by n + 1 pigeons then at least

one pigeonhole contain more than pigeon
Generalized Pigeon hold Principle : If n pigeonholes are occupied by kn + 1
pigeons then at least one pigeonhole contain k + 1 or more pigeon
Pigeonhole Principle: If A is average number of pigeons per hole then some pigeonhole
contain
a. at least [A] pigeons
b. at most [A] pigeons
2. Generating Functions
Sequence : A sequence {an|n 0} is a function from the set of nonnegative integers to the
real numbers (often the integers). The terms of the sequence {a n|n 0} are the values
a0, a1, a2,
an : A closed form for the sequence an is an algebraic expression for an as a function of n
Ordinary Generating Function : The (ordinary) generating function for the sequence
a0, a1, a2,of real numbers is the formal power series f(x) = a 0 + a1x + a2x2 + ..=
r 0 a r x r or any equivalent closed form expression.
Exponential Generating Function : The (exponential) generating function for the

x
sequence a0, a1, a2,of real numbers is the power series f(x) = a 0 + a1 1! + a2 x2=
r 0 a r x r or any equivalent closed form expression.
Sequence
1, 2, 3, 4, 5, .
Notation
{n}
Closed form
12, 22, 32, 42, 52,.
{n2}
1 x
(1 x ) 3
13, 23, 33, 43, 53,
{n3}
1 4 x x 2
( x 1) 4
1, r, r2, r3, r4,.
{rn}
1
1 rx
1
( x 1) 2
x
Fibonacci
Fn
1 x x 2
sequence
TABLE 1. GF for some functions
3. Recurrence relations
Recurrence Relation : A recurrence relation is an equation expressing a term of a
sequence as a function of prior terms in the sequence. i.e., for any integer n 1 nth term
of the sequence {a r }r 0 to one or more of the terms a0, a1, a2,.,ar
Linear recurrence relation of degree k: A general form of linear recurrence relation of

degree k is given by
c0an + c1an-1 + .+ckan-k = f(n)
c0, c1,..,ck, f(n) are functions of n or constants
if f(n) = 0 then it is called Homogeneous Recurrence Relation (HRR)
If f(n) 0 then it is called IN-Homogeneous Recurrence Relation (IHRR)
Solution : A sequence {a r }r 0 is solution if it satisfies recurrence relation

1. {a n } is a solution then {Can}is also solution
2. {a n } and {bn} are solution then {C1an + C2bn} is also solution.
Rules : Consider a linear recurrence relation of degree k has constant coefficients and
1. If there are fewer than k initial or boundary conditions then there will not be a unique
solution.
2. If k values are given consecutively (I.C or B.C) then there will be a unique solution
3. If k values are not consecutive these may not guarantee a unique solution.
Solution of Homogeneous recurrence relation : if the recurrence relation is
an + c1an-1 + . + ckan-k = 0 for n k, ck 0

then characteristic polynomial for this recurrence relation is
C(t) = tk + c1tk-1 + c2tk-2 + .+ ck = 0
The solution for this equation are called characteristic roots.
Real and distinct roots : If roots are real and distinct of the characteristic equation be
b1, b2,., bk then the general solution for the HLRR is
n
an = C1 b1n + C2 b2n +.+ Ck bk where C1, C2,.,Ck are arbitrary constants.

Real and repeated roots : if the real and distinct of the characteristic equation be
b1, b2,.bs, where s k then the general solution for the HLRR is
U1(n) + U2(n) + .+ Us(n) where
m 1
n
Ui(n) = [D0 + D1n + D2n2 + .+ Dmi 1 n i | bi where mi is the multiplicity of the root bi
Complex roots : if the complex roots are ib then

an = n[K1cos(nb) + K2sin(nb)]
Solutions Inhomogeneous recurrence relations : If the recurrence relation is
an + c1an-1 + . + ckan-k = f(n) for n k, ck 0
Then the general solution is given by
H
P
H
an = a n a n , where a n is general solution of the corresponding homogeneous
P
recurrence relation and a n is particular solution of Inhomogeneous recurrence relation.
f(n)
C(t)
P
Form of Particular solution a n
Dbn
C(b) 0
Abn
Dbn
b is root of C(t) of multiplicity m
Anmbn
Dnsbn
C(b) 0
(A0 + A1n + + Asns)bn
Dnsbn
b is root of C(t) of multiplicity m

nm(A0 + A1n + + Asns)bn
TABLE 2. Form of particular Solution
Rules : If the recurrence relation is

an + c1an-1 + . + ckan-k = f(n) for n k, ck 0
P
P
P
P
1. If {a n1 }n 0 and {a n 2 }n 0 are solutions of IHRR then {an1 an 2 }n 0 is solution of HRR.
i.e., Difference of two solutions of IHRR is a solution of HRR

2. Linear combination of independent solutions of HRR is a solution of HRR.
CLASS ROOM OBJECTIVES

Basic Counting
1. Institute A provides 4 courses Institute B-provides 5 courses and Institute C-provides
3 courses in how many ways we can select a course.
2. Find the number of binary strings of length 2?
3. How many binary strings of length n are there?
4. Find the no. of binary strings of length 8 which start with 0
5. How many non-negative integers of length x < 105 are there
(a) find how many are even
(b) find how many are add
6. How many non-negative integers <105 contains the digit 1
7. How many palindromes of length 7 are there using English alphabets
8. How many palindromes of length n are there using English alphabet
9. How many palindromes are there of 5 digits? How many palindromes of 5 digits
are even?
10. How many 5-lettered words can be made out of 26 letters, repetitions allowed, but
not consecutive repetitions (that is, a letter may not follow itself in the same
word)?
11. How many positive integers 100 are
(a) divisible by 2
(b) divisible by 3
(c) divisible by 4 & 6
(d) divisible by 2 & 3 & 5
12. What is the power of 11 in the prime factorization of 300! ?
13. Find the no. of positive divisors of 300
14. How many odd positive divisors of 300
15. How many even positive divisors of 300
16. How many positive divisors do 283952 have? What is sum of these divisors?
17. Two girls have picked 10 roses, 15 sunflowers and 14 daffodils. What is the number
of ways they can divide the flowers among themselves? Gate Question No 4
18. How many 4 digit even numbers have all 4 digits distinct? Gate Question No 8
19. In how many ways a man and a woman who are not married each other can be
selected from 10 married couples.
20. Gate Question No 10
21. Find the number of subsequences are there of string of length n?
22. Number of non-empty subsequence of string of length n ______
23. Find number of substrings of string of length n ________
Pigeonhole Principle:
1) In a class there are 24 students, at least how many are born on same day of a week
(a) 2
(b) 3
(c) 4
(d) 5
2) In a class there are 110 students at least how many are born in same month of a year
3) At least 6 students are born on same day of a week. Which of the following is
minimum number of students which assure this result
(a) 35
(b) 42
(c) 49
(d) 56
4) What is the minimum number of cards one need to pick from a pack of 52 cards to
guarantee, atleast 3 cards from some same suit
(a) 27
(b) 9
(c) 39
(d) none
5) Let A= {1,2,3,4,5,6,7,8,9,10}.How many integers must be choosen from A so that
sum of a pair of integers is 11.
6) A bag contains red, white, and blue socks. What is the minimum number of socks one
need to pick to be sure of getting
(i)
a pair with the same color.
(ii)
two pairs of same color
(iii)
three pairs of same color
Permutation without Repetition
1) How many ways 10 people can be arranged in a row
(a) so that certain pair is always together
(b) So that certain pair never together
2) How many ways 7 women and 3 men can be arranged in a row
(a) so that all 3 men are together
(b) so that no two men are together
Circular Permutation
1) How many ways 10 people can be arranged in circle
(a) so that certain pair is always together
(b) so that particular pair is never together
Combinations without Repetion:
1) 10 friends meet in a party and shake hands with one another. Number of handshakes
is __________
2) 10 friends sends greeting and to one another.Number of cards sent is ______
3) How many ways 5 members can be selected from 10 people
4) How many ways 3 men and 2 women can be selected from 6 men and 7 women
5) How many ways 5 members committee can be selected from 6 men and 7 women
a. containing atleast 2 women in committee.
b. containing atleast 2 men and atleast 2 women
6) How many ways 8 members can be selected from 9 women and 10 men containing
atleast 1 women.
7) There are 21 consonants and 5 vowels in English alphabet. Consider only 8-letter
words with 3 different vowels and 5 different consonants.
(a) How many such words can be formed?
(b) How many such words contain the letter a?
(c) How many such words contain the letter b?
(d) How many such words contain the letter a and b?
(e) How many such words start with a and end with b?
Statement for Linked Answer Questions Q8 & Q9:
Common data Question Suppose that a robot is placed on the Cartesian plane. At
each step it is allowed to move either one unit up or one unit right, i.e., if it is at (i, j)
then it can move to either (i+1, j) or
(i, j+1).
8. How many distinct paths are there for the robot to reach the point (10,10) starting
from the initial position (0,0)?
(GATE-CS-2007)
20
(a)
10
(b) 2 20
(c) 210
(d) none of the above
9. Suppose that the robot is not allowed to traverse the line segment from (4,4) to (5,4).
With this constraint, how many distinct paths are there for the robot to reach (10, 10)
starting from ( 0, 0)?
(GATE-CS-2007)
(a) 29
(b) 219
8
11
(c) x
4
5
20
8
11
x
(d)
10
4
5
Permutations with repetitions

1. Number of different outcomes possible by tossing (a) 2 coins (b) 10 coins
2. Number of different outcomes possible by tossing (a) 2 dice (b) 10 dice?
3. Number of binary strings of length n are there?
Combinations with repetitions
1.
Number of different outcomes is possible by tossing (a) 2 similar coins? (b) 10

similar coins?
2.
Number of different outcomes is possible by tossing 2 similar dice? 10 similar dice?
3.
Number of ways of placing 20 similar balls into 5 boxes?
4.
Number of ways of placing 20 similar balls into 5 boxes where each box is nonempty?
5.
Number of integral solutions to x1+x2++x5=20 where x1>=-3, x2>=0,

x3>=4,x4,x5>=2.
Order and unordered partitions

1.
How many ways letters of the word MISSISSIPPI can be arranged?

(a) SO that all Is are together
2.
How many ways can 14 men partitioned in to 6 teams where 1 team has 3
members,2nd team 2 members,3rd team has 3 members,4,5,and 6th team each has 2
members.
3.
How many ways can 12 of 14 people be distributed in to 3 teams where first team
has 3 members, 2nd team has 5 members, 3rd team has 4 members.
PREVIOUS QUESTIONS
1.
How many sub strings can be formed from a character string of length n?
(GATE-CS-1989)
2. The number of substrings (of all lengths inclusive) that can be formed from a
character string of length n is
(GATE-CS-1994)
n n 1
n n 1
(a) n
(b) n2
(c)
(d)
2
2
3. How may substrings of different lengths (non-zero) can be formed from a character
string of length n?
(GATE-CS-1998)
2
n
(a) n
(b) n
(c) 2
(d) n (n + 1) / 2
4.
Two girls have picked 10 roses, 15 sunflowers and 14 daffodils. What is the number
of ways they can divide the flowers among themselves?
(GATE-CS-1999)
(a) 1638
(b) 2100
(c) 2640
(d) None of the above
5.
The number of binary strings of n zeros and k ones such that no two ones are
adjacent is:
(GATE-CS-1999)
(a)
n1
Ck
(b)
Ck
(c)
C k 1
(d) None of the above
6. A multiset is an unordered collection of elements where elements may repeat ay

number of times. The size of a multiset is the number of elements in it counting
repetitions.
(GATE-CS-2000)
(a) What is the number of mutisets of size 4 that can be constructed from n distinct
elements so that at least one element occurs exactly twice?
(b) How many multisets can be constructed from n distinct elements?
7.
The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52

cards to guarantee that three cards are from some same suit is
(GATE-CS-2000)
(a) 3
(b) 8
(c) 9
(d) 12
8.
How many 4 digit even numbers have all 4 digits distinct?

(GATE-CS-2001)
(a) 2240
(b) 2296
(c) 2620
(d) 4536
9.
Let A be a sequence of 8 distinct integers sorted in ascending order. How many

distinct pairs of sequences, B and C are there such that (i) each is sorted in ascending
order. (ii) B has 5 and C has 3 elements, and (iii) the result of merging B and C gives
A?
(GATE-CS-2003)
(a) 2
(b) 30
(c) 56
(d) 256
10. n couples are invited to a party with the condition that every husband should be
accompanied by his wife. However, a wife need not be accompanied by her husband.
The number of different gatherings possible at the party is
(GATE-CS-2003)
2n
2n
2n !
* 2 n
(a)
(b) 3n
(c) n
(d)
2
n
n
11. m identical balls are to be placed in n distinct bags. You are given that m kn, where
k is a natural number 1. In how many ways can the balls be placed in the bags if
each bag must contain at least k balls?
(GATE-CS-2003)
mk
m kn n 1
(a)
(b)
n 1
n 1
10
m 1
m kn n k 2
(c)
(d)
nk
nk
12. Mala has a colouring book in which each English letter is drawn two times. She
wants to paint each of these 52 prints with one of k colours, such that the colour-pairs
used to colour any two letters are different. Both prints of a letter can also be
coloured with the same colour. What is the minimum value of k that satisfies this
requirement?
(GATE-CS-2004)
(a) 9
(b) 8
(c) 7
(d) 6
13. Let n = p2q, where p and q are distinct prime numbers. How many numbers m satisfy
1 m n and gcd(m, n) = 1? Note that gcd (m, n) is the greatest common divisor of
m and n.
(GATE-IT-2005)
2
(a) p(q1)
(b) pq
(c) (p 1)(q1)
(d) p(p1)(q1)
14. What is the minimum number of ordered pairs of non-negative numbers that should
be chosen to ensure that there are two pairs (a, b) and (c, d) in the chosen set such
that
a c mod 3 and b d mod 5
(GATE-CS- 2005)
(a) 4
(b) 6
(c) 16
(d) 24
15. Consider the polynomial P(x) = a0 + a1x + a2x2 + a3x3, where. The minimum number
of multiplications needed to evaluate p on an input x is
(GATE-CS-2006)
(a) 3
(b) 4
(c) 6
(d) 9
Statement for Linked Answer Questions Q16 & Q17:
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to
move either one unit up or one unit right, i.e., if it is at (i, j) then it can move to either
(i+1, j) or
(i, j+1).
16. How many distinct paths are there for the robot to reach the point (10,10) starting
from the initial position (0,0)?
(GATE-CS-2007)
20
(a)
(b) 2 20
(c) 210
(d) none of the above
10
17. Suppose that the robot is not allowed to traverse the line segment from (4,4) to (5,4).
With this constraint, how many distinct paths are there for the robot to reach (10, 10)
starting from ( 0, 0)?
(GATE-CS-2007)
(a) 29
20
10
(b) 219
(c)
8

4
11
(d)
11
11
18. The exponent of 11 in the prime factorization of 300! is

(a) 27
(b) 28
(c) 29
(d) 30
(GATE-IT2008)
19. In how many ways can b blue balls and r red balls be distributed in n distinct boxes?
(GATE-IT-2008)
(n b 1)!( n r 1)!
(n (b r ) 1)!
(a)
(b)
( n 1)!b!( n 1)!r!
( n 1)!( n 1)!(b r )!
(c)
n!
b!r!
(d)
(n (b r ) 1)!
n!(b r 1)!
20. Consider the expression tree shown. Each leaf represents a numerical value, which
can either be 0 or 1. Over all possible choices of the values at the leaves, the
maximum possible value of the expression represented by the tree is ________
(GATEIT-2014)
21. The number of distinct positive integral factors of 2014 is ________________.

(GATE-IT
2014)
22. The maximum number of arithmetic operations required to evaluate the polynomial
P(X) = X5 + 4X3 + 6X + 5 for a given value of X, using only one temporary variable
is
(GATE-IT-2014)
23. The number of 4 digit members having their digits in non-decreasing order (from left
to right) constructed by using the digits belonging to the set {1, 2, 3} is _______
(GATE-CS-2015)
24. The number of divisors of 2100 is ________
(GATE-CS-2015)
12
PRACTICE QUESTIONS
Product rule /Sum Rule
1.
A student can choose a computer project from one of 3 lists. The lists contain 23, 15
and 19 possible projects respectively. How many ways a student can choose a
project?
2.
How many ways can we get a (i) a sum of 4 or 8 (ii) even sum when two
distinguishable dice are rolled?
3.
Problem 2 when two indistinguishable dice are rolled?
4.
How many ways are there to pick a man & a woman who are not married from 30
married couple?
5.
In a group of 8 men and 9 women we can pick one man and one woman in how
many ways?
6.
Out of nine different pairs of shoes, in how many ways could I choose a right
shoe and a left shoe, which should not form a pair?
7.
If n distinguishable dice are rolled, how many possible outcomes are there
8.
From a deck of playing cards in how many ways can we draw

(i)
a heart or a spade
(ii)
Heart or an ace
(iii)
Ace or a king
(iv)
A card numbered 2 through 10
(v)
A numbered card or a king
9.
How many licence plates with 3 english letters followed by 4 digits can be formed
(i)
if repetitions of letters and digits are allowed
(ii)
if only letters can be repeated
(iii)
if only digits can be repeated
(iv)
If no repetitions are allowed
10. How many different license plates are there that involve 1, 2 or 3 letters followed by
1, 2,3 or 4 digits?
11. How many bit strings of length n are there?
13
12. How many bit strings of length n are there starting with 1?
13. How many n-digits integers (n > 1) are there?
(i) Which are even?
(ii) Which do not have the digit 0?
(iii) Which do not contain the digit 5?
14. How many 3 digit numbers can be formed using the digits 1, 3, 4,5,6,8 & 9? How
many 3 digit numbers can be formed if no digit can be repeated?
15. How many 2-digit or 3-digit numbers can be formed using the digits 1, 3, 4,5,6,8 &
9?
16. How many numbers can be formed using 1, 3, 4,5,6,8 & 9 if repetitions are not
allowed?
17. How many 3-digit numbers are there which are even & have no repeated digits
18. How many 4 digit numbers can be formed using the digits 2,3 ,5,6,8,& 9
(i)
If repetitions are allowed
(ii)
if no repetitions are allowed
(iii)
if no repetitions are allowed & are even numbers
(iv)
if no repetitions are allowed & are greater than 4000
(v)
if no repetitions are allowed & divisible by 5
19. How many integers between 1 and 104 contain exactly one 8 and one 9
20. How many integers between 105 & 106
(i)
have no digits other than 2,5,or 8
(ii)
have no digits other than 0,2,5,or 8
21. How many even integers between 4000 and 7000 have four different digits?
22. How many integers less than 10000 can be made with the eight digits 0, 1,
2, 3, 4, 5, 6, 7?
23. How many 4 letter password can be made with letters (A Z)
a. With no repetition
b. With unlimited repetition.
c. Which starts with a and ends with z.
d. Which starts with a & ends with z and there should be no repetition.
24. How many 9 letter palindromes are there using English alphabet?
25. How many k letter palindromes are possible using English alphabets?
26. How many k letter palindromes are possible using n-letter alphabets?
27. How many 5 digit palindromes are there?
14
28. How many ways 10 people can be seated in a row so that two of them are not next to
each other?
29. Number of non-negative integers less than 109 that contain the digit 1?
30. A card is drawn from a deck of cards & replaced it before next draw. How many
ways 10 cards can be drawn so that 10th card is a repetition of previous draw?
31. 101 players entered in Knock out tournament .How many matches must be played in
total?
32. Number of subset of a set with n elements?
33. Each computer system has a password which is 6 to 8 characters long, where each
character is an upper case letter or a digit. Each password must contain at least one
digit. How many possible passwords are there?
34. How many positive divisors do 300 have? What is sum of these divisors?
35. How many factors of 2 95 are larger than 1,000,000?
36. How many positive divisors does 360 have? How many are even? How many are
odd? How many are perfect squares?
37. number of positive integers ,=100 which are divisible by (a) 2 (b) 3 (c)4
38. The exponent of 11 in prime factorization of 300!
39. The exponent of 3 in prime factorization of 300!
40. How many 5 letter words can be out of 26 letters, repetitions allowed, but not
consecutive repetitions?
41. A flag has to be designed with 6 vertical strips in yellow, green, blue & red. In how
many ways can this be done so that no two adjacent strips have the same color?
42. 5 men A, B, C, D, and E intend to speak at a meeting. In how many orders can they
do
(i)
Without B speaking before A.
(ii)
In B speak immediately after A
43. Number of substrings of different lengths formed from a character string of length n.
44. The number of diagonals that can be drawn by joining the vertices of an octagon is:
(a) 28
(b) 48
(c) 20
(d) 24
Pigeonhole principle
15
1. In a class of 13 students at least how many were born in same month?

2. In a group of 25 people at least how members were born on same day of a week.
3. Among a group 367 people at least how many are with same birth day?
4. What is the minimum number of students in a class to be sure that two of them are
born in same month?
(a) 24
(b) 25
(c)36
(d)37
5. Which of the following is minimum number of students in a class assuring that three
of them are born in same month?
(a) 24
(b) 29
(c)36
(d) 37
6. How many integers from 1 through 100 must you pick in order to be sure of getting
one that is divisible by 5?
7. How many integers must be selected from the set {1, 3, 5, 7, 9, 11, 13, 15} to
guarantee that at least one pair of these numbers add up to 16.
8. 401 letters are distributed to 50 apartments then some apartments receive at lest
_______ letters and
9. Find the minimum number n of integers to be selected from S = {1, 2,..., 9}
so that:
(a) The sum of two of the n integers is even.
(b) The difference of two of the n integers is 5.
10. Find the minimum number of students needed to guarantee that 4 of them
were born:
(a) on the same day of the week;
(b) in the same month
11. Find the minimum number of students needed to guarantee that 3 of them:
(a) have last names which begin with the same first letter;
(b) were born on the same day of a month (with 31 days).
1.
How many ways are there to select a first prize winner, a second prize winner, and a
third prize winner from 100 different people in a contest.
2.
Number of license plates formed by 3 distinct letters followed by 4 distinct digits.
3.
How many ways can the letters of English alphabet can be arranged without
repetition so that there are exactly 5 letters between the letters a and b.
4.
A bookshelf contains 5 German books, 7 Spanish books and 8 French books.

Each book is different from one another.
16
i) How many different arrangements can be done of these books?

ii) How many different arrangements can be done of these books if books of each
language must be next to each other?
iii) How many different arrangements can be done of these books if all the French
books must be next to each other?
iv) How many different arrangements can be done of these books if no two
French books must be next to each other?
5.
How many ways can 5 men and 5 women be seated in a row so that
a) so that all 5 men are together
b) no two women can sit next to each other
c) Men and women arranged alternatively
Circular permutations
1.
How many ways 8 people can be arranged in circle

a. so that certain pair is always together
b. so that particular pair is never together
2.
How many ways 4 boys and 4 girls be seated around a circular table, so that no two
women are next to each other
Combinations without repetitions

1. In how many ways can a committee of (a) 5 (b) 5 or more be chosen from 9 people?
2. In how many ways can a committee of 5 teachers and 4 students from 9 teachers and
15 students.
3. In how many ways can a committee of 5 teachers and 4 students from 9 teachers and
15 students, if teacher A refuses to serve if student B is on the committee.
4. There are 10 physics and 5 maths teacher you want to select 3 physics, and 2 maths
teacher, in how many way selection can be made.
5. How many 10 digits binary numbers are there with exactly six 1s?
6. How many rectangles are there on an 8x8 chessboard?
7. How many squares are there on a 8x8 chessboard
8. Twenty five points are chosen in a plane so that no three of them are collinear.(a)
How many straight lines do they determine (b) How many triangles they determine
Permutation with repetitions
17
1.
There are 25 T or F questions in an examination. How many different ways can a

student do the examination, if he or she can also choose to leave the answer blank?
2.
A multiple choice test has 15 questions and 4 choices for each answer. How many
ways 15 questions be answered so that exactly 3 answers are correct.

1.
Number of ways of placing 10 similar balls into 6 boxes?
2.
How many ways 10 similar books can be placed on 3 different shelves?
3.
Number of ways of placing 10 similar balls into 5 boxes ?
4.
Number of ways of placing r similar balls into n boxes where each box is nonempty?
5.
Number of integral solutions to x1+x2++x5=20 where x1>=-2, x2>=3,

x3>=4,x4,x5>=2.
6.
Number of ways placing atmost 19 balls into 5 boxes (or) Number of integral
solutions to x1+x2++x5<=19.

1.
How many ways letters of the following words can be arranged?

(a) MATHEMATICS
(b) PROPORTION
2.
How many ways can 12 of 14 people be distributed in to 3 teams where first team
has 3 members, 2nd team has 5 members,3rd team has 4 members.
3.
How many ways can 12 of 14 people be distributed in to 3 teams of 4 each.

(unordered partitions)
4.
How many ways 23 books are given to 5 students so that 2 of the students will have
4 books each and other will have 5 books each?
5.
How many ways may we write number 9 as the sum of 3 positive integer summands?
Here order counts, so for example 1+7+1 is different from 7+1+1
Properties of Binomial Coefficient

1. How many terms are there in expansion of (x + y) 10
2. What is the coefficient of x3 y7 in expansion of (x + y)10
18
3. How many terms are therein expansion of (x + y + z)10

4. What is the coefficient of x3 y7 z
5. What is coefficient in trinomial expansion of (x + y + z)10, coefficient of x6 y2 z2
LAST MINUTE REVISION
r permutation of n objects without repetition : npr

1) npr =
n!
(n r )!
2) npn = n!
Number of circular permutations of n objects = (n-1)!
Number of circular permutations of n objects in clockwise direction =
Number of circular permutations of n objects in anti-clockwise direction
Number of r-combinations without repetitions:

ncr =
(n 1)!
2
(n 1)!
2
n!
npr
=
r !1 r !(n r )!
(n 1 r )!
r!(n 1)!
The number of r-combinations of n objects with unlimited repetions is
The number of r-permutation of n objects with unlimited repetitions = nr.
KEY
Combinatorics
Previous Questions
1. n(n+1)/2
6. (a)
n n 1
2
2. D
, (b) Unlimited 7. C
3. D
4. C
8. B
5. A
9. C
10. B
19
11. B
12. D
13. D
14. C
15. A
16. A
17. D
18. C
19. A
20. 6 TO 6
21. 8 TO 8
22. 7 TO 7
23. 15
24. 36
Practice Questions
Product rule /Sum Rule
1. 23+15+19=57
5. 72
2. (i) 3+5=8, (ii) 18
3. (i) 2+3=5, (ii) 12
4. 30x29
7. 6n
6. 72
8. (i) 13 + 13 , (ii) 13+4l, (iii) 4+4 , (iv) 9.4=36, (v) 36+4=40

9. (i) 263 x104, (ii) 263 x10x9x8x7, (iii) if 26x25x24 x104, (iv) 26x25x24 x10x9x8x7
10. (26+262+263)(10+102 +103 +104)
14. (i)73 (ii) 7x6x5
11. 2n
12. 2n
13. 9 x 10n-1
15. 72+ 73
16. 7!+7x6x5x4x3x2+7x6x5x4x3+7X6X5X4+7X6X5+7X6+7
17. 9X8+8X8X4
18. (i) 64, (ii) 6X5X4X3, (iii) 5X4X3X3, (iv) 4X4X3X1+3X4X3X2, (v) 5X4X3X1
20. (i) 36, (ii) 3X45
19. 4X3X8X8
21. 728
22. 4095
23.
k
2
24. 265
25. 26
28. 10!-2x9!
29. 10999
26.
k
2
27. 900
30. total 10 th card is not a repetition of previous draw = 5210519x52?

31. 100
32. 2n
33. (366266)+ (367267)+ (368268)?
34. (i)18, (ii) (20+21+22 )(30+31)(50+51+52)
35. 76 factors
36. (1+3)(1+2)(1+1) = 24; 18; 6; 4

37. (a)50, (b) 33, (c) 25
38.
300 300
27 2 29
11 112
20
39.
300 300 300 300

2 3 4
3
3
3
3
42. (i) 4!+3x3!+2x3!+3!, (ii) 4!
40. 26x254
41. 4x35
43. n(n+1)/2
44. C
Pigeonhole principle
1. 2
2. 4
3. 2
4. A
5. B
7. 5
8. 9
9. -
10. -
11. -
6. 81

1. P(100,3)
2. P(26,3).P(10,4)
3. -
4. (i) 20 ! (ii) 3!5!7!8! = 146313216000 (iii) (13) 8!12! = 251073478656000

(iv) (13) (12) (11) (10) (9) (8) (7) (6) 12! = 24856274386944000.
5. -
Circular permutations
1. -
2. 3!x4!.
Combinations without repetitions

1. (a) C(9,5) (b) C(9,5)+ C(9,6)+C(9,7)+C(9,8)+C(9,9)
2. C(9,5).C(15,4)
3. C(9,5).C(15,4)C(8,4)C(14,3).
4. -
5. C(10,6)
6. C(9,2).C(9,2)=36x36=1296.
7. 82+72+62+52+42+32+22+12=204
8. (a) C(25,2) , (b) C(25,3)

Permutation with repetitions
1. 325
2. C(15,3). 312

1. C(6-1+10,10)=C(15,10)
2. C(5-1+10,10)
3. C(5-1+20,20)
4. C(5-1+15,15)
5. C(5-1+17,17)
6. C(6-1+19,19)
21
1. (a)
10!
10!
,
2!2!2!1!1!1!1!1! 3!2!2!1!1!1!
3. C(14,12)
1 12!
3! 4!3
2. C(14,12)
4. C(5,2)
12!
3!5!4!
23!
4!4!5!5!5!
5. a+b+c=9 where 1abc7

(a,b,c) Number of permutations
1,1,7 3!/2!1!=3
1,2,6 3!=6
1,3,5 3!=6
1,4,4 3!/2!1!=3
2,2,5 3!/2!1!=3
2,3,4 3!=6
3,3,3 3!/3!=1
Total =28 ways
Properties of Binomial Coefficient
1. -
2. -
3. -
4. -
5. -
22

Dms Set - 1 Counting

Diunggah oleh

Informasi Dokumen

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Dms Set - 1 Counting

Diunggah oleh

Hak Cipta:

Format Tersedia

CONTENTS

1. If equivalence classes of an equivalence relation on a finite set S has m elements, then

Combination : A combination of n objects taken r at a time (r combination of n

r-Permutation of n objects without repetition : P(n, r) or n Pr

Circular Permutation : Objects arranged in a circle (preference will be given relative to

3. Number of circular permutations of n objects in anti-clockwise direction =

Number of r-combinations without repetitions : C(n, r) or n C r

Restricted Permutation : Number of permutation of n objects taken r at a time in which

Constrained repetitions : Suppose q1, q2,.,qt are non-negative integers

Pigeonhole Principle : If n pigeonholes are occupied by n + 1 pigeons then at least

Exponential Generating Function : The (exponential) generating function for the

12, 22, 32, 42, 52,.

13, 23, 33, 43, 53,

1, r, r2, r3, r4,.

of the sequence {a r }r 0 to one or more of the terms a0, a1, a2,.,ar

Linear recurrence relation of degree k: A general form of linear recurrence relation of

Solution : A sequence {a r }r 0 is solution if it satisfies recurrence relation

an + c1an-1 + . + ckan-k = 0 for n k, ck 0

an = C1 b1n + C2 b2n +.+ Ck bk where C1, C2,.,Ck are arbitrary constants.

Complex roots : if the complex roots are ib then

b is root of C(t) of multiplicity m

(A0 + A1n + + Asns)bn

b is root of C(t) of multiplicity m

Rules : If the recurrence relation is

i.e., Difference of two solutions of IHRR is a solution of HRR

CLASS ROOM OBJECTIVES

(d) none of the above

Permutations with repetitions

Number of different outcomes is possible by tossing (a) 2 similar coins? (b) 10

Number of different outcomes is possible by tossing 2 similar dice? 10 similar dice?

Number of ways of placing 20 similar balls into 5 boxes?

Number of integral solutions to x1+x2++x5=20 where x1>=-3, x2>=0,

Order and unordered partitions

How many ways letters of the word MISSISSIPPI can be arranged?

(d) None of the above

6. A multiset is an unordered collection of elements where elements may repeat ay

The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52

How many 4 digit even numbers have all 4 digits distinct?

Let A be a sequence of 8 distinct integers sorted in ascending order. How many

18. The exponent of 11 in the prime factorization of 300! is

21. The number of distinct positive integral factors of 2014 is ________________.

Problem 2 when two indistinguishable dice are rolled?

From a deck of playing cards in how many ways can we draw

1. In a class of 13 students at least how many were born in same month?

Number of license plates formed by 3 distinct letters followed by 4 distinct digits.

A bookshelf contains 5 German books, 7 Spanish books and 8 French books.

i) How many different arrangements can be done of these books?

How many ways 8 people can be arranged in circle

Combinations without repetitions

There are 25 T or F questions in an examination. How many different ways can a

Combinations with repetitions

Number of ways of placing 10 similar balls into 6 boxes?

How many ways 10 similar books can be placed on 3 different shelves?

Number of ways of placing 10 similar balls into 5 boxes ?

Number of integral solutions to x1+x2++x5=20 where x1>=-2, x2>=3,

Order and unordered partitions

How many ways letters of the following words can be arranged?

How many ways can 12 of 14 people be distributed in to 3 teams of 4 each.

Properties of Binomial Coefficient

3. How many terms are therein expansion of (x + y + z)10

LAST MINUTE REVISION

r permutation of n objects without repetition : npr

Number of circular permutations of n objects = (n-1)!

Number of circular permutations of n objects in clockwise direction =