ASSIGNMENT 1

1. [UGA 2018] The number of permutations σ of 1, 2, 3, 4 such that |σ(i) − i| < 2 for every 1 ≤ i ≤ 4 is
(a) 2 (b) 3 (c) 4 (d) 5.
2. (i) Find the number of four letter word that can be formed from the letters of the word HISTORY. (each
letter to be used at most once)
(ii) How many of them contain only consonants?
(iii) How many of them begin & end in a consonant?
(iv) How many of them begin with a vowel?
(v) How many contain the letters Y?
(vi) How many begin with T & end in a vowel?
(vii) How many being with T & also contain S?
3. In how many ways can 5 letters be mailed if there are 3 different mailboxes available if each letter can
be mailed in any mailbox?
4. Every telephone number consists of 7 digits. How many telephone numbers are there which do not
include any other digits but 2, 3, 5 & 7?
5. Find the number of 5 lettered palindromes which can be formed using the letters from the English
alphabets.
6. Find all possible three digits even numbers which can be formed with the condition that if 5 is one of the
digit, then 7 is the next digit.
7. If repetitions are not permitted
(i) How many 3 digit numbers can be formed from the six digits 2, 3, 5, 6, 7 & 9?
(ii) How many of these are less than 400?
(iii) How many are even?
(iv) How many are odd?
(v) How many are multiples of 5?
8. There are 11 players P1, P2,…..,P11 in a team. How many batting orders are possible if
(a) Either P1 is at first position or P5 is at last position
(b) Neither P1 is at first position nor P5 is at last position.
9. There are n concurrent lines and another line parallel to one of them. The number of different triangles
that will be formed by the (n + 1) lines, is
 2

10. Find the number of times the digit 5 will be written when listing integers from 1 to 1000.
11. A seven digit number divisible by 9 is to be formed by using 7 out of numbers {1, 2, 3, 4, 5, 6, 7, 8, 9}.
Find the number of ways in which this can be done.
12. The number of ways in which we can choose 3 squares of unit area on a chess board such that one of the
squares has its two sides common to other two squares
13. How many four digit numbers greater than 5000 can be formed from the digit 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 if
only the digit 4 may be repeated?
 3

Answers Key
1. (d) 2. 3. 243 4. 47 5. (26)3
(n − 1)(n − 2)
6. 365 7. 20 8. 33022080 9. 10. 300
2
11. 4 × 7! 12. 292 13. 2645

Solutions
1. [2018] The number of permutations σ of 1, 2, 3, 4 such that |σ(i) − i| < 2 for every 1 ≤ i ≤ 4 is
(a) 2 (b) 3 (c) 4 (d) 5.
Ans: D
Sol: 1234, 2134, 1243, 2143,1324,
2. (i) Find the number of four letter word that can be formed from the letters of the word HISTORY. (each
letter to be used at most once)
(ii) How many of them contain only consonants?
(iii) How many of them begin & end in a consonant?
(iv) How many of them begin with a vowel?
(v) How many contain the letters Y?
(vi) How many begin with T & end in a vowel?
(vii) How many being with T & also contain S?
Sol: (i) Given, H, I, S, T, O, R, Y i.e. 7 letters
⸫ Number of four letters word
= 7  6 5 4
= 840
(ii) Number of four letter words that contain only consonants
= 5 4  3 2
= 120
(iii) We require word to begin and end with a consonant
This can be done as
 4

= 25  16
= 400
(iv) Words beginning with a vowel are

= 240
(v) Words containing the letter Y
= Total words – words which don’t contain Y
= 840 − ( 6  5  4  3)
= 840 − 360
= 480
(vi) Begin with T and end with a vowel

=5×4×2
= 40
(vii) Begin with T and also contain S
TS-- or T-S- or T—S
Blank space can be filled by remaining 5 letters
⸫ Total words = 3 × 5 × 4 = 60
3. In how many ways can 5 letters be mailed if there are 3 different mailboxes available if each letter can
be mailed in any mailbox?
Sol: Here every letter have 3 ways or 3 mail boxes in which they can go
⸫ Total number of ways = 3  3  3  3  3 = 243
4. Every telephone number consists of 7 digits. How many telephone numbers are there which do not
include any other digits but 2, 3, 5 & 7?
Sol: Here every digit of telephone number has 4 ways to be filled with 4 digits
⸫ Total number of ways
 5

= 4 4 4 4 4 4 4
= 47
5. Find the number of 5 lettered palindromes which can be formed using the letters from the English
alphabets.
Sol: Palindromes are those where reverse order gives the same word again
Thus 5 letter palindrome can be formed from 26 alphabets in

⸫ Total number of ways = (26)3

6. Find all possible three digits even numbers which can be formed with the condition that if 5 is one of the
digit, then 7 is the next digit.
Ans. 365
CASE I: if 5 come’s the next digit is 7
5 7 Even No.
1⨯1⨯5 = 5 ways
CASE II: if 5 doesn’t come then may or may not come.
Any no. excluding 0 & 5Any no. excluding 5Even No.
8⨯9⨯5 = 360 ways
Total = 360 + 5 = 365 ways
7. If repetitions are not permitted
(i) How many 3 digit numbers can be formed from the six digits 2, 3, 5, 6, 7 & 9?
(ii) How many of these are less than 400?
(iii) How many are even?
(iv) How many are odd?
(v) How many are multiples of 5?
Sol: (i) Three digit number from 6 digit

= 6 × 5 × 4 = 120
(ii) Numbers less than 400
 6

= 2 × 5 × 4 = 40
(iii) even numbers

= 2 × 5 × 4 = 40
(iv) Odd numbers

= 5 × 4 × 4 = 80
(v) Multiples of 5

= 5 × 4 × 1 = 20
8. There are 11 players P1, P2,…..,P11 in a team. How many batting orders are possible if
(a) Either P1 is at first position or P5 is at last position
(b) Neither P1 is at first position nor P5 is at last position.
Sol: (a) Let n(A) be number of batting order when P1 is at first position n(B), when P5 is at last position
n ( A  B ) , when P1 is at first position and P5 is at last.

n ( A ) = 10! = 3628800
n ( B ) = 10! = 3628800
n ( A  B ) = 9! = 362880

 n ( A  B ) = n ( A) + n ( B ) − n ( A  B )
= 10!+ 10!− 9!
= 6894720
 7

(b) Neither P1 is at first position nor P5 is at last position

= Total possible order – when either P1 is at first or P5 is at last
= 11!− (10!+ 10!− 9!)
= 39916800 − ( 6894720 )
= 33022080
9. There are n concurrent lines and another line parallel to one of them. The number of different triangles
that will be formed by the (n + 1) lines, is
(n − 1)(n − 2)
Ans.
2
Sol. In this case, one side will be the parallel line which is non-concurrent.
The other parallel line cannot form any triangle.
So, the remaining two sides can be chosen in n-1C2 ways
(n − 1)(n − 2)
=
2
10. Find the number of times the digit 5 will be written when listing integers from 1 to 1000.
Ans. 300
Sol. One digit occurrence = 1
Occurrence in 2 digit numbers
Ten's place (50 to 59)= 10
9
Unit's place (15, 25...95) =
19
Occurrence in 3 digit numbers:
Hundreds place (500 to 599) = 100
Tens’s Place - (150, 150 … 159
250, 251 … 259
   = 90
950, 951 … 959
 105, 115, 125 ... 195
Unit’s Place - 
 205, 215, 225 ... 295
   = 90
905, 915, 925 ... 995 ) 280

 Number of times digit 5 will be written

 8

= 280 + 19 + 1
= 300
11. A seven digit number divisible by 9 is to be formed by using 7 out of numbers {1, 2, 3, 4, 5, 6, 7, 8, 9}.
Find the number of ways in which this can be done.
Sol. Sum of all digits = 45
For a number to be divisible by 9, sum of all digits should be divisible by 9.
 The sum of digits of the required 7 digit numbers = 36.
Less than 36 is not possible.
So, we have to exclude two digits whose sum is, 9 i.e. (1, 8), (2, 7), (3, 6), (4, 5) = 4 ways
The 7 digits can be arranged in 7! ways
Number of ways = 47!
12. The number of ways in which we can choose 3 squares of unit area on a chess board such that one of the
squares has its two sides common to other two squares
Ans. 292
Sol. Total number of square having unit area on chess board = 88 =64
1 1'
2 2'
3 3'
For square at 1 position, No of ways of chasing 3 square = 1
For square at 1’ position, No of ways of choosing 3 square = 3
For square at 2 position, No of ways of choosing 3 square = 3
At position 2, Number of ways of choosing 3 square = 6,
So, Total number of ways of chessing 3 square

=
( 2 1 + 6  3 )  2 +
(3  2 + 6  6 )  6
upper and lower row middle row

= 40 + ( 42 )  6

= 292
13. How many four digit numbers greater than 5000 can be formed from the digit 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 if
only the digit 4 may be repeated?
Sol. 2645
Let abcd represent the integer a 103 + b 102 + c 10 + d
 9

Note that abcd > 5000 iff a ≥ 5 and b,c,d are not all 0, a must be a number in {5,6,7,8,9}. Suppose
that a is selected from {5,6,7,8,9}
If 4 is not repeated, then the number of ways to choose b,c,d is 9 x 8 x 7
If 4 appears exactly twice, then the number of ways to choose b,c,d is (3C2) x 8
If 4 apperts exactly three times, then the number of ways to choose b,c,d is 1
Hence the answer is
5  ( 9  8  7 + 3 C2  8 + 1) = 2645
FUNCTION ASSIGNMENT 1

1. [UGA 2018] Let 10 red balls and 10 white balls be arranged in a straight line such that 10 each are on
either side of a central mark. The number of such symmetrical arrangements about the central mark
is.
(a) 10!/5!5! (b) 10! (c) 10!/5! (d) 2.10!
2. In how many ways we can pick 5 letters out of ARRANGEMENT
3. Find the number of ways in which 4 boys and 2 girls (all are of different heights) can be arranged in a
line so that boys as well as girls among themselves are in decreasing order of height (from left to
right).
4. (a) Out of seven consonants and four vowels, the number of words of six letters, formed by taking
four consonants and two vowels is (Assume that each ordered group of letter is a word):
(b) Find the number of permutations of the word “AUROBIND” in which vowels appear in an
alphabetical order.
(c) Find the number of permutations of the word “AUROBIND” in which no two vowels come
together.
5. Find the number of ways in which letters of the word VALEDICTORY be arranged so that the
vowels may never be separated.
6. Number of six digit numbers which have 3 digits even and 3 digits odd, if each is to be used atmost
once is ..............
7. The total number of ways of arranging the letters AAAA BBB CC D E F in a row such that letters C
are separated from one another is
8. The number 2006 is made up of exactly two zeros and two other digits whose sum is 8. The number
of 4 digit numbers with these properties (including 2006) is :
9. Five students A, B, C, D and E from a team to take part in a 5 leg relay competition. If A cannot run
the first leg and D cannot run the last leg, how many ways can we arrange them to run the relay ?
10. Find how many three digit numbers, lying between 100 and 999 inclusive, have two and only two
cosecutive digits identical.
FUNCTION 2

Answers Key
8! 5
1. (a) 2. 131 3. 15 4. 151200, , C4 4!4!
4!
5. 967680
6. 64800 7. 1386000 8. 21 9. 78 10. 162

SOLUTIONS
1. [2018] Let 10 red balls and 10 white balls be arranged in a straight line such that 10 each are on either
side of a central mark. The number of such symmetrical arrangements about the central mark is.
(a) 10!/5!5! (b) 10! (c) 10!/5! (d) 2.10!
Ans: A
2. In how many ways we can pick 5 letters out of ARRANGEMENT
Sol: (a) Given, 2A, 2R, 2N, 2E, 1M, 1T, 1G
Different 5 letter combination can be
(i) 2 alike, 2 alike, 1 different = 4C2  5C1

= 6  5 = 30
(ii) 2 alike, 3 different = 4C1  6C3

= 4  20 = 80
(iii) All different = 7C5 = 21
⸫ total number of ways = 30 + 80 + 21 = 131
3. Find the number of ways in which 4 boys and 2 girls (all are of different heights) can be arranged in a
line so that boys as well as girls among themselves are in decreasing order of height (from left to right).
Ans. 15
6
Sol. C2⨯1⨯1 = 15
4. (a) Out of seven consonants and four vowels, the number of words of six letters, formed by taking four
consonants and two vowels is (Assume that each ordered group of letter is a word):
(b) Find the number of permutations of the word “AUROBIND” in which vowels appear in an
alphabetical order.
(c) Find the number of permutations of the word “AUROBIND” in which no two vowels come together.
Sol: (a) Six letters words containing 4 consonants out of given 7 consonants and 2 vowels out of given 4
vowels
FUNCTION 3

= 7 C4  4C2  6!
= 151200
8!
(b) Arrangements in which vowels appear in alphabetical order =
4!
(c) 5C4 4!4!

5. Find the number of ways in which letters of the word VALEDICTORY be arranged so that the vowels
may never be separated.
Ans: (967680)
Sol: Given, V, L, D, C, T, R, Y, A, E, I, O
Keeping vowels together
Number of different words = 8! × 4! = 967680
6. Number of six digit numbers which have 3 digits even and 3 digits odd, if each is to be used atmost once
is ..............
Ans (64800)
Sol: Here, we have 5 odd digits and 5 even digits which includes 0 also which can’t be in the first position
Total such number
= 5C3  5C3  6!− 5C3  4C2  5!
= 72000 − 7200
= 64800
7. The total number of ways of arranging the letters AAAA BBB CC D E F in a row such that letters C are
separated from one another is
Sol: Here,
 A  A  A  A  B B B D  E  F
If C is arranged in these gaps then they are not together
⸫ Number of ways
10!
= 11C2 
4!3!
= 1386000
8. The number 2006 is made up of exactly two zeros and two other digits whose sum is 8. The number of 4
digit numbers with these properties (including 2006) is :
Ans. 21
Sol. let the other two digits a and b.
FUNCTION 4

a+b=8
(1,7), (2,6), (3,5), (4,4)
Number of digits = 3×2×3 + 3 = 21
9. Five students A, B, C, D and E from a team to take part in a 5 leg relay competition. If A cannot run the
first leg and D cannot run the last leg, how many ways can we arrange them to run the relay ?
Sol. (78)
Total number of ways is
5! – 4! – 4! + 3! = 120 – 24 – 24 + 6 = 78
Alternatively, we consider the following cases
Case (i) A and ‘D do not run the first or last leg, In this case, the number of arrangements is 3 x 2 x 3!
= 26
Case (ii) D does not run the first leg and A runs the last leg. In this case, number of ways is
3 x 3! = 18
Therefore, total number of ways = 36 + 24 + 18 = 78.
10. Find how many three digit numbers, lying between 100 and 999 inclusive, have two and only two
cosecutive digits identical.
Sol. 162
Thee are two possible formats for three digit numbers to have two and only two consecutive digis
identical :
(i) aac where a  0 and c  a, or

(ii) abb wherea  0and a  b

Thus the number of such integers is
9 x 9 + 9 x 9 = 162
 ASSIGNMENT-3 1

1. [UGA 2020] A group of 64 players in a chess tournament needs to be divided into 32 groups
of 2 players each. In how many ways can this be done?
64!  64  62   4  2 
(a) (b)    ....   
32!232  2  2   2  2 
64! 64!
(c) (d)
32!32! 2 64
2. Find the total number of ways in which n2 number of identical balls can be put in n numbered
boxed (1, 2, 3, ......... n) such that ith box contains at least i number of balls.
3. Find the number of ways in which n different prizes can be distributed amongst m (< n)
persons if each is entitled to receive at most n – 1 prizes.
4. (a) The number of ways in which 12 balls can be divided between two friends, one receiving 8
and the other 4, is
(b) The number of ways in which 52 cards can be divided into 4 sets, three of them having 17
cards
each and the fourth one having just one card
5. Seven different coins are to be divided amongst three persons. If no two of the persons receive
the same number of coins but each receives at least one coin and none is left over, then the
number of ways in which the division may be made is:
6. Number of different ways in which 8 different books can be distributed among 3 students, if
each student receive at least 2 books is ...............
7. The number of ordered triplets of positive integers which are solutions of the equation
x + y + z = 100 is
8. The total number of ways of selecting six coins out of 20 one rupee coins, 10 fifty paise coins
and 7 twenty five paise coins is
9. Find number of integral solutions of:
(a) x + y + z = 10 ; x  0, y  2, z  0
(b) x + y + z + w = 12 ; x  4, y  −2, z  −3
(c) 2 x + y + z = 10 ; x  2, y  0, z  0
(d) x + y + z = 12 ; 1  x  3, y  0, z  0
10. In how many ways 5 fruits can be selected out of unlimited identical bananas, identical apples
& identical oranges.
 2

Answers Key
n2 + n − 2
1. (a) 2. 2
Cn −1 3. mn – m

12! 52!
4. (a) (b) 5. 630 6. 2940
(17!) 3!
3
8!4!

7. 4851 8. 28 9. 36,120,16,33
10. 21

SOLUTIONS
1. [2020] A group of 64 players in a chess tournament needs to be divided into 32 groups of 2
players each. In how many ways can this be done?
64!  64  62   4  2 
(a) (b)    ....   
32!232  2  2   2  2 
64! 64!
(c) (d)
32!32! 2 64

Ans: A
Sol: Direct formula based
2. Find the total number of ways in which n2 number of identical balls can be put in n numbered
boxed (1, 2, 3, ......... n) such that ith box contains at least i number of balls.
n2 + n − 2
2
Ans. Cn −1

Sol. B1 + B2 + …..+ Bn = n2 and Bi ≥ i

n(n + 1)
B1 + B2 + …..+ Bn = n 2 − and Bi ≥ 0
2
n2 − n
B1 + B2 + …..+ Bn = and Bi ≥ 0
2
n2 + n − 2
2
Ways = Cn −1

3. Find the number of ways in which n different prizes can be distributed amongst m (< n)
persons if each is entitled to receive at most n – 1 prizes.
Ans. mn – m
Sol. Each prize can go to any one of m persons i.e. has m options.
 3

At most n - 1 prizes = All ways - Ways of distributing n prizes to a single person

All ways = mn
Ways of distributing n prizes to a single person = m
 Numbers of ways = mn - m
4. (a) The number of ways in which 12 balls can be divided between two friends, one receiving 8
and the other 4, is
(b) The number of ways in which 52 cards can be divided into 4 sets, three of them having 17
cards
each and the fourth one having just one card
12! 52!
Ans: (a) (b)
(17!) 3!
3
8!4!

Sol: (a) Since, one can have 8 and other 4

12! 12!
Total number of ways =  2! =
8!4!2! 8!4!
(b) As any three of them will get 17 cards and remaining will get 1 card
52!
Total number of ways =
(17!)
3
3!

5. Seven different coins are to be divided amongst three persons. If no two of the persons receive
the same number of coins but each receives at least one coin and none is left over, then the
number of ways in which the division may be made is:
Ans: (630)
Sol: If each receives at least 1 coin, then division can be done only as (1, 2, 4)
 7! 
Total number of ways = 3!  = 630
1!2!4!
6. Number of different ways in which 8 different books can be distributed among 3 students, if
each student receive at least 2 books is ...............
Sol: If each receives at least two books then the division can be done as (2, 2, 4) or (3, 3, 2)
 8! 8! 
Total number of ways = 3!  +  = 2940
 ( 2!) 4!2! ( 3!) 2!2!
2 2

7. The number of ordered triplets of positive integers which are solutions of the equation
x + y + z = 100 is
 4

Ans (4851)
Sol: Given, x + y + z = 100, x  1, y  1, z  1
Let x = x + 1, y = y + 1, z = z + 1
 x + y + z = 97, x, y, z  0
⸫ Number of ordered pairs
= 97 +3−1C3−1
= 99C2 = 4851
8. The total number of ways of selecting six coins out of 20 one rupee coins, 10 fifty paise coins
and 7 twenty five paise coins is
Ans: (28)
Sol: Let x be 1 rupee coin, y be 50 paise coin and z be 25 paise coin
 x + y + z = 6; x, y, z  0
⸫ Number of ways
= 3+ 6−1C3−1
= 8 C2
= 28
9. Find number of integral solutions of:
(a) x + y + z = 10 ; x  0, y  2, z  0
(b) x + y + z + w = 12 ; x  4, y  −2, z  −3
(c) 2 x + y + z = 10 ; x  2, y  0, z  0
(d) x + y + z = 12 ; 1  x  3, y  0, z  0
Sol: (a) Given, x + y + z = 10 ; x  0, y  2, z  0 or z  1
Let y = 2 + y & z = 1 + z
 x + y + z = 7; x, y, z  0
⸫ Number of solution
= 3+ 7 −1C3−1
= 9C2 = 36
(b) Given, x + y + z + w = 12 ; x  4, y  −2, z  −3
Let x = 4 + x, y = −2 + y, z = 3 + z
 5

 x + y + z + w = 7; x, y, z, w  0

⸫ Total number of solution
= 4+ 7 −1C4−1
= 10C3
= 120
(c) Given, 2 x + y + z = 10 ; x  2, y  0, z  0
 y + z = 10 − 2 x
When x = 2, y + z = 6
Number of solutions = 7
When x = 3, y + z = 4
Number of solutions = 5
When x = 4, y + z = 2
Number of solutions = 3
When x = 5, y + z = 0
Number of solutions = 1
Total number of solutions = 7 + 5 + 3 + 1 = 16
(d) Given, x + y + z = 12 ; 1  x  3, y  0, z  0
x can have values 1, 2, or 3
When x = 1, y + z = 11
Number of solutions = 12
When x = 2, y + z = 10
Number of solutions = 11
When x = 3, y + z = 9
Number of solutions = 10
⸫ Total number of solutions = 12 + 11 + 10 = 33
10. In how many ways 5 fruits can be selected out of unlimited identical bananas, identical apples
& identical oranges.
Sol: Let banana be B , Apples be A and Oranges be O
 B + A + O = 5; B, A, O  0
Number of ways
= 3+5−1C3−1
= 7 C2
= 21
FUNCTION ASSIGNMENT 1

1. Find the number of positive integer solutions of x + y + z = 10, where x, y, z are unequal
2. There are three piles of identical red, blue and green balls each pile contains at least 10 balls. The
number of ways of selecting 10 balls if twice as many red balls as green balls are to be selected is
3. The number of ways in which 5 identical balls can be kept in 10 identical boxes, if not more than one
can go into a box, is
4. 5 balls are to be placed in 3 boxes. Each box can hold all the 5 balls. Number of ways in which the
balls can be placed so that no box remains empty, if :
(a) balls are identical but boxes are different
(b) balls are different but boxes are identical
(c) balls as well as boxes are identical
(d) balls as well as boxes are identical but boxes are kept in a row
5. Find number of non-negative integral solutions of: x + y + z  5

6. For the number 34  52  73 , find

(a) Number of divisors
(b) Number of even divisors
(c) Number of divisors which are multiple of 21
(d) Sum of all the divisors
7. Find exponent of
(a) 3 in 100!
(b) 10 in 100!
(c) Power of 5 in 30C12

8. (a) In how many ways the number 7056 can be resolved as a product of 2 factors.
(b) Find the number of ways in which the number 300300 can be split into 2 factors which are
relatively prime.
9. The number of odd proper divisors of 3p . 6m . 21n is :
10. The number of divisors of 23 . 33 . 53 . 75 of the form 4n + 1, n ∈ N is :
11. [UGA 2015] The number of factors of 215  310  56 which are either perfect squares or perfect cubes
(or both) is :
(a) 252 (b) 256 (c) 260 (d) 264.
FUNCTION 2

12. [UGA 2020] The number of subsets of {1; 2; 3; : : : ; 10} having an odd number of elements is
(a) 1024 (b) 512 (c) 256 (d) 50.
13. [UGA 2015] Let A = {a1, a2, …a10} and B = {1, 2}. The number of functions f : A → B for which
the sum of f(a1) +….+ (f10) is an even number, is
(a) 128 (b) 256 (c) 512 (d) 768
14. [UGA 2015] The number of one to one functions from a set with 3 elements to a set with 6 elements
is
(a) 20 (b) 120 (c) 216 (d) 720
15. Determine the number of 4-elements subsets {a, b, c, d} of {1,2,3,4,…,20} such that a + b + c + d is
divisible by 3.
FUNCTION 3

Answers Key
1. (24) 2. (4) 3. (1) 4. (6)
5. 56 6. 150400 7. (a) 48, (b) 2 8. (a) 23 (b) 32
9. (p + m + n + 1) (n + 1) – 1
10. 47 11. (a) 12. (b) 13. (c)
14. (b) 15. 11901

Solutions
1. Find the number of positive integer solutions of x + y + z = 10, where x, y, z are unequal
Ans: (24)
Sol: x, y, z , these are (1, 2, 7), (3, 6, 1), (1, 4, 5), (2, 3, 5)
Total = 3! 4 = 24 = 20 + 4
2. There are three piles of identical red, blue and green balls each pile contains at least 10 balls. The
number of ways of selecting 10 balls if twice as many red balls as green balls are to be selected is
Ans: (4)
Sol: Let the number of green balls be x.
Then the number of red balls is 2x.
Let the number of blue balls be y
Then,
x + 2 y + y = 10
 3x + y = 10
 y = 10 − 3x
Clearly, x can take values 0, 1, 2, 3
The corresponding values of y are 10, 7, 4 and 1.
Thus, the possibilities are (0, 10, 0), (2, 7, 1), (4, 4, 2) and (6, 1, 3), where (r, b, g) denotes the number
of red, blue, green balls
3. The number of ways in which 5 identical balls can be kept in 10 identical boxes, if not more than one
can go into a box, is
Ans: (1)
Sol: One way
FUNCTION 4

4. 5 balls are to be placed in 3 boxes. Each box can hold all the 5 balls. Number of ways in which the
balls can be placed so that no box remains empty, if :
(a) balls are identical but boxes are different
(b) balls are different but boxes are identical
(c) balls as well as boxes are identical
(d) balls as well as boxes are identical but boxes are kept in a row
Sol. (a) x1 + x2 + x3 = 5
xi  1
No. of solutions = 5-3+2C2
= 4 C2 = 6
(b) As boxes are identical
Case I : (3, 1, 1) distribution 5C3 = 10 ways
Case II : (2, 2, 1) distribution
 (5C2  3C2  1)/2 (for boxes)
= 15 ways
Total 25 ways
(c) Balls and Boxes are identical
3 balls in 3 boxes → 1 way
Remaining 2 balls in 3 boxes → 2 ways (2, 0) and (1, 1)
Total = 2 ways
(d) Box Box Box
1 1 3
3 1 1
1 3 1
1 1 3
2 2 1
1 2 2
2 1 2
6 ways
5. Find number of non-negative integral solutions of: x + y + z  5
Ans: (56)
FUNCTION 5

Sol: Given, x + y + z  5
It means x + y + z can take values 0, 1, 2, 3, 4 or 5
⸫ Number of non-negative integral solution are
= 3+5−1C3−1 + 3+4−1C3−1 + 3+3−1C3−1 + 3+2−1C3−1 + 3+1−1C3−1 + 3−1C3−1

= 7C2 + 6C2 + 5C2 + 4C2 + 3C2 + 2C2

= 21 + 15 + 10 + 6 + 3 + 1
= 56
6. For the number 34  52  73 , find
(a) Number of divisors
(b) Number of even divisors
(c) Number of divisors which are multiple of 21
(d) Sum of all the divisors
Sol: (a) Given, 34  52  73
Number of divisors = (4 +1) (2 + 1) (3 + 1)
= 5 × 3 × 4 = 60
(b) Number of even divisors = 0 (as no even digit is there)
(c) Number of divisors which are multiple of 21
= ( 4 )( 2 + 1)( 3)
= 4  3 3
= 36
(d) Sum of all divisors
 35 − 1   53 − 1   7 4 − 1 
=   
 3 −1   5 −1   7 −1 

=
( 242 )(124 )( 2400 )
2 46
= 1500400
7. Find exponent of
(a) 3 in 100!
(b) 10 in 100!
(c) Power of 5 in 30C12

Sol: (a) Exponent of 3 in 100!

FUNCTION 6

100  100  100  100  100 

= + 2 + 3 + 4 + 5 + .....
 3   3   3   3   3 
= 33 + 11 + 3 + 1 + 0
= 48
(b) Exponent of 10 in 100!
100  100  100 
= + + + ....
 10   10   10 
2 3

= 10 + 1 + 0
= 11
30!
(c) 30C12 =
18!12!
 30   30 
 5  +  25  = 7

18  12 
 5  = 3,  5  = 2
   
Exponent of 5 = 7-3-2=2
8. (a) In how many ways the number 7056 can be resolved as a product of 2 factors.
(b) Find the number of ways in which the number 300300 can be split into 2 factors which are
relatively prime.
Ans. (a) 23 (b) 32
Sol. (a) 7056 = 24 .32 .73
5 3 3 +1
= 23
2
(b) 300300 = 22 .52 .3.11.13.7
There are 6 primes.
Ways = 26 = 32
9. The number of odd proper divisors of 3p . 6m . 21n is :
Ans. (p + m + n + 1) (n + 1) – 1
Sol. Number given
=3p 6m21n
= 3p . 2m . 3m . 3n . 7n
= 2m . 3(p+m+n) . 7n
As we have to exclude even divisors, we will consider only 3 and 7.
FUNCTION 7

So,
Number of proper divisors (excluding 1)
= (p + m + n + l) (n + l)–1
10. The number of divisors of 23 . 33 . 53 . 75 of the form 4n + 1, n ∈ N is :
Ans. 47
Sol: 50, 51, 52,53,70,71,72,73,74,75,30,31,32,33 for factors of the
from 4n + 1
(4k + 1) (4k + 1) (4k + 1) → 4 × 3 × 2 = 24
and (4k + 3) (4k + 3) (4k + 1) → 3 × 2 × 4 = 24
 Total factors 24 + 24 – 1
= 47
11. [2015] The number of factors of 215  310  56 which are either perfect squares or perfect cubes (or
both) is :
(a) 252 (b) 256 (c) 260 (d) 264.
Ans: A
Sol: Number of factors which are perfect squares = (7 + 1)(5 + 1)(3 + 1) = 192
Number of factors which are perfect cube = (5 + 1)(3 + 1)(2 + 1) = 72
Number of factors which are perfect square and perfect cube = (2 + 1)(1 + 1)(1 + 1) = 12
Hence number of divisors = 192 + 72 – 12 = 252
12. [2020] The number of subsets of {1; 2; 3; : : : ; 10} having an odd number of elements is
(a) 1024 (b) 512 (c) 256 (d) 50.
Ans: B
Sol: 29
13. [2015] Let A = {a1, a2, …a10} and B = {1, 2}. The number of functions f : A → B for which the sum
of f(a1) +….+ (f10) is an even number, is
(a) 128 (b) 256 (c) 512 (d) 768
Ans: C
Sol: let a1, a2, …a9 connected to any of the element = 29 ways, then f(a10) choose accordingly the sum of
f(a1) +….+ (f9).
14. [2015] The number of one to one functions from a set with 3 elements to a set with 6 elements is
(a) 20 (b) 120 (c) 216 (d) 720
FUNCTION 8

Ans: B
Sol: 6.5.4 = 120
15. Determine the number of 4-elements subsets {a, b, c, d} of {1,2,3,4,…,20} such that a + b + c + d is
divisible by 3.
Sol. 11901
For i = 0, 1, 2, let
Ai = {j: 1 ≤ j ≤20 , j  i(mod3}
Note that |A0| = 6, |A1| = 7 and |A2| = 7
It can be shown that for a,b,c,d  a + b + c + d is divisible by 3 iff

(i) a, b, c, d  A i = 2 for alli = 1, 2, or

(ii) a, b, c, d  A 0 = 1 and a, b, c, d  A i = 3for some i :1  i  2; or

(iii) a, b, c, d  A 0 = 2 and a, b, c, d  A i = 1for alli = 1, 2;or

(iv) a, b, c, d  A 0 = 4

Thus the number of 4 – elements subsets {a,b,c,d} OF {1,2,3,4,….,20} such that a + b + c + d is

divisible by 3 is

 A1  A 2   A 0  A1   A1   A 2   A 0   A1 
  +  + + +   A1  A 2 +  
 2  2   1  3   1   3   2   4 
2 2
7 7 6 6
=   + 6    2 +    7 2   = 11901
 2  3  2  4
 ASSIGNMENT-5 1

1. [UGB 2017] Let A = {1; 2; : : : ; n}: For a permutation P = (P (1); P (2); ….. ; P (n)) of the elements
of A, let P (1) denote the first element of P . Find the number of all such permutations P so that for
all i; j  A:
if i < j < P (1), then j appears before i in P; and
if P (1) < i < j, then i appears before j in P.
2. [UGB 2020] A finite sequence of numbers (a1…,an) is said to be alternating if
a1  a 2 , a 2  a 3 , a 3  a 4 ,a 4  a 5 ,....

or a 1  a 2 ,a 2  a 3 , a 3  a 4 , a 4  a 5 ,....

How many alternating sequences of length 5, with distinct numbers a1, a2, ……, a5 can be formed
such that ai {1, 2....., 20} for i = 1, 2, ….., 5?
3. There are 16 men sitting on a round table. Find the number of ways to select 7 men such that no two
are consecutive.
4. How many garlands of 6 flowers of different colours be made out of 10 flowers of different colors?
5. In how many ways a team of 11 cricket players may sit on a round table so that captain, vice captain
& wicket keeper are together.
6. Find the number of ways in which seven persons can be arranged at a round table if two particular
persons may not sit together.
7. Given 11 points, of which 5 lies on one circle, other than these 5, no 4 lie on one circle. Then the
maximum number of circles that can be drawn so that each contains atleast three of the given points
is:
8. Suppose 40 objects are placed along a circle at equal distances. In how many ways can 3
objects be chosen from among them so that no two of the three chosen objects are adjacent nor
diametrically opposite?
9. Suppose that each of n people knows exactly one piece of information, and all n pieces are different.
Every time person A phones person B, A tells B everything he known, while B tells A nothing. What
is the minimum of phones called between pairs of people needed for everyone to know everything?
10. Consider a 2008 x 2008 chess board. Let M be the smallest number of rectangles that can be drawn
on the chess board so that the sides of every cell of the board is contained in the sides of the one of
the rectangles. Find the value of M. (For example for the 2 x 3 chess board, the value of M is 3).
 2

Answers Key
n
(n − 1)!
1.  (r − 1)!(n − r )! = 2
r =1
n −1
2. 20C
5 × 16 × 2

3. 8
C6 16 / 7 4. 12600 5. (241920)
6. 480 7. 156 8. 7720
9. 2n - 2 10. 2009

Solutions
1. [UGB 2017] Let A = {1; 2; : : : ; n}: For a permutation P = (P (1); P (2); ….. ; P (n)) of the elements
of A, let P (1) denote the first element of P . Find the number of all such permutations P so that for
all i; j  A:
if i < j < P (1), then j appears before i in P; and
if P (1) < i < j, then i appears before j in P.
Sol: if P(1) = r
Then number before r are in decreasing order and number after r are in increasing order.
Number of arrangements are
n
(n − 1)!
 (r − 1)!(n − r )! = 2
r =1
n −1

2. [UGB 2020] A finite sequence of numbers (a1…,an) is said to be alternating if

a1  a 2 , a 2  a 3 , a 3  a 4 ,a 4  a 5 ,....

or a 1  a 2 ,a 2  a 3 , a 3  a 4 , a 4  a 5 ,....

How many alternating sequences of length 5, with distinct numbers a1, a2, ……, a5 can be formed
such that ai {1, 2....., 20} for i = 1, 2, ….., 5?
Sol: a1 a2 a3 a4 a5
b1 b2  3! × 2! = 12
a1 a2 a3 a4 a5
b3 b1 b2 2
a1 a2 a3 a4 a5
b2 b1 b2 2
Total updown sequences = 16 ways
Total sequences = 20C5 × 16 × 2
 3

3. There are 16 men sitting on a round table. Find the number of ways to select 7 men such that no two
are consecutive.
Ans. 8
C6 16 / 7

Sol. Number of ways to select one man = 16C1

⇒ Adjacent men of that man can’t come.

To select 6 more from remaining 13 = 8C6

Each selection repeated 7 times.

16
C1 8C6
Ways =
7
4. How many garlands of 6 flowers of different colours be made out of 10 flowers of different colors?
Ans: (12600)
Sol: Given, 10 flowers and garland of 6 flowers has to be prepared
Number of ways

= 10C6 .
( 6 − 1)!
2
5!
= 10C6
2
= 12600
5. In how many ways a team of 11 cricket players may sit on a round table so that captain, vice captain
& wicket keeper are together.
Ans: (241920)
Sol: We want captain, vice-captain and wicket keeper to be together
Thus assuming them as 1 and arrange with remaining 8 players
Total number of ways
= ( 9 − 1) ! 3!
= 8! 3!
= 241920
6. Find the number of ways in which seven persons can be arranged at a round table if two particular
persons may not sit together.
Ans: (480)
Sol: Number of ways in which 7 persons can be arranged at a round table if two particular person may
not sit together
 4

= Total arrangement – when two particular person are together

= ( 7 − 1) !− ( 6 − 1) !2!
= 6!− 5!2
= 720 − 240
= 480
7. Given 11 points, of which 5 lies on one circle, other than these 5, no 4 lie on one circle. Then the
maximum number of circles that can be drawn so that each contains atleast three of the given points
is:
Ans. 156
Sol. Given that, In 11 points, 5 lie on one circle, other than these, no 4 lie on one circle. As we know,
from 3 points one circle will be formed.
So,
i) Selecting 2 points from 5 lies on one circle and 1 from other circle. = 5C2 x 6C1
= 60
ii) Selecting 1 points from 5 lie on one circle and 2 from other circle = 5C1 x 6C2
= 75
iii) Selecting all 3 points from other 6 points = 6C3
iv) One circle is already drawn from 5 points
Total number of circles = 60 + 75 + 20 + 1=156
8. Suppose 40 objects are placed along a circle at equal distances. In how many ways can 3
objects be chosen from among them so that no two of the three chosen objects are adjacent nor
diametrically opposite?
Sol: One can choose 3 objects out of 40 objects in 40 3 ways. Among theese choices all would be
together in 40 cases; exactly two will be together in 40 × 36 cases. Thus three objects can be chosen
such that no two adjacent in 40 3 - 40 - (40 × 36) ways. Among these,
furthrer, two objects will be diametrically opposite in 20 ways and the third would be on either
semicircle in a non adjacent portion in 40 - 6 = 34 ways. Thus required number is
 40 
  − 40 − ( 40  36 ) − ( 20  34 ) = 7720
3
9. Suppose that each of n people knows exactly one piece of information, and all n pieces are different.
Every time person A phones person B, A tells B everything he known, while B tells A nothing. What
is the minimum of phones called between pairs of people needed for everyone to know everything?
 5

Sol. we claim that the minimum of calls needed is 2n–2. Let A be a particular person, the 2n–2 calls made
by A to each of the persons and vice versa will leave everybody informed. Thus at most 2n –2 calls
are needed. Next we prove that we need at least 2n–2 calls. Suppose that there is a sequence of calls
that leaves everybody informed. Let B be the first person to be fully informed and that he receives
his last piece of information at the pth call. Then each of the remaining n–1 people must have placed
at least one call prior to p so that B can be fully informed. Also these people must received at least
one call after p since they were till not full informed at the pth call. Thus we need at least 2(n-1)
calls.
10. Consider a 2008 x 2008 chess board. Let M be the smallest number of rectangles that can be drawn
on the chess board so that the sides of every cell of the board is contained in the sides of the one of
the rectangles. Find the value of M. (For example for the 2 x 3 chess board, the value of M is 3).
Sol. The answer is M = 2009. All the horizontal sides can be covered by 1004 pieces of 1 x 2008
rectangles except the boundary of the chess board which can be covered by the boundary rectangle.
The remaining vertical sides can be covered by1004 pieces of 2008 x 1 rectangles. Thus M ≤ 2009.
Now supose that the chess borard has been covered by M rectangles in the desired way. Let a of the
rectangles have their top and bottom on the top and bottom of the board, b of the rectangles have
their top on the top of the board r of the rectangles have their bottom on the bottom of the board and
d of the rectangles have neither thir top nor bottom on the top or bottom of the board.
Since there are 2007 internal horizontal lines we have b + c + 2d ≥ 2007.Since ther are 2009 vertical
lines intersecting the top of theboard we hae 2a + 2b ≥ 2009 or a + b ≥ 1005. Sjmiliary a + c ≥ 1005.
Thus 2a + b + c ≥ 2010. Hence 2(a + b + c + d) ≥ 4017 i.e. M = a + b + c + d ≥ 2009
1. Given twelve integers, show that two of them can be chosen whose difference is divisible by 11.
2. The city of Leningrad has five million inhabitants. Show that two of these must have the same
number of hairs on their heads, if it is known that no person has more than million hairs on his or
her head.
3. In the country of Courland there are M football teams, each of which has 11 players. All the players
are gathered at an airport for a trip to another country for an important game, but they are
traveling on “stand by’’ There are 10 flights to their destination, and it turns out that teach flight
has room for exactly M players. One football player will take his own helicopter to the game, rather
than travelling standby on a plane. Show that at least one whole team will be sure to get to the
important game.
4. Show that in any group of five people, there are two who have an identical number of friends
within the group.
5. Several football teams enter a tournament in which each team plays every other team exactly
once. Show that any moment during the tournament there will be two teams which have played,
up to that moment, an identical number of games.
6. Ten students solved a total of 35 problems in a math Olympiad. Each problem was solved by
exactly one student. There is at least one student who solved exactly one problem, at least one
student who solved exactly two problems, and at least one student who solved exactly three
problems. Prove that there is also at least one student who has solved at least five problems.
7. Five young workers received as wages 1500 rubles altogether. Each of them wants tobuy a cassette
player costing 320 rubles. Prove tha least one of them must wait for the next paycheck to make his
purchase.
8. In a brigade of 7 people, the sum of the ages of the members is 332 years. Prove that three
memebers can be chosen sothat the sum of their ages is no less than 142 years.
9. Porve that of any 52 integers, two can always be found such that the difference of their square is
divisible by 100.
10. Prove that there exists a power of three which ends with the digits 001 (in decimal notation)
 Solution
1. Given twelve integers, show that two of them can be chosen whose difference is divisible by 11.
Sol. The pigeon holes are the remainder when divided by 11. The pigeons are the numbers. If two
numbers have the same remainder when divided by 11. Their difference must be divisible by 11.
2. The city of Leningrad has five million inhabitants. Show that two of these must have the same
number of hairs on their heads, if it is known that no person has more than million hairs on his or
her head.
Sol. The pigeon holes here are the numbers of hairs on a person’s head (from 1 to 1,000,000). The
pigeons are the citizens of Leningrad.
3. In the country of Courland there are M football teams, each of which has 11 players. All the players
are gathered at an airport for a trip to another country for an important game, but they are
traveling on “stand by’’ There are 10 flights to their destination, and it turns out that teach flight
has room for exactly M players. One football player will take his own helicopter to the game, rather
than travelling standby on a plane. Show that at least one whole team will be sure to get to the
important game.
Sol. Let us sort the football players by team as they come off their airplanes. There will be 10M + 1
players to sort. The General Pigeon Hole Principle assures us that there will be one team which has
11 players, and this team is complete.
4. Show that in any group of five people, there are two who have an identical number of friends
within the group.
Sol. There are give possible numbers of acquaintances for nay person : 0,1,2,3 or 4. So it would seem that
each could have a different number of friends. However, if any person has four acquaintances, then
no person may have zero acquaintances. Hence two people must have the same number of
acquaintances.
5. Several football teams enter a tournament in which each team plays every other team exactly
once. Show that any moment during the tournament there will be two teams which have played,
up to that moment, an identical number of games.
Sol. If there are k teams, then the number of games played by each team varies from 0 to k –1. However,
if any team has played k –1 games, then it has played every other team, and no team has played 0
 games. Hence wee are fitting k teams into k –1 pigeon holes, which are either the number from 0
through k –2 or the number 1 through k –1
6. Ten students solved a total of 35 problems in a math Olympiad. Each problem was solved by
exactly one student. There is at least one student who solved exactly one problem, at least one
student who solved exactly two problems, and at least one student who solved exactly three
problems. Prove that there is also at least one student who has solved at least five problems.
Sol: At least 1 + 2 + 3 = 6 problems were solved by the students mentioned in the problem statement.
Therefore, there are 29 problems left to be solved, and 7 students to account for them. If each
student had solved only 4 problems, then there would have been only 28 problems solved.
Therefore, one student must have solved at least 5 problems.
7. Five young workers received as wages 1500 rubles altogether. Each of them wants tobuy a cassette
player costing 320 rubles. Prove tha least one of them must wait for the next paycheck to make his
purchase.
Sol : The sum S of their earning is 1500 rubles, so the above princple guarantees that at least one worker
earned no more than 1500/5 = 300 tubles. Such a worker must wait for his cassette player.
8. In a brigade of 7 people, the sum of the ages of the members is 332 years. Prove that three
memebers can be chosen sothat the sum of their ages is no less than 142 years.
Sol: We look at all possible triles of brigade members. If we add the three ages in each gorup, then sum
these numbers, this final sum must be 15.332 (since each person apears in a triaple 15 times). Yet
there are altogther 35 triples. This means that there is a triple of bridage members such that the
sum of their ages is not less than 15.332/35, which is grater than 142
9. Porve that of any 52 integers, two can always be found such that the difference of their square is
divisible by 100
Sol. When divided by 100, a perfect squar can give only 51 remainder, since the number x 2 and
(100 – x)2 giv the same remainder. Hence of 52 integers, the squares of two must have the same
remainder when divided by 100. These two squres differ by a multiple of 100.
10. Prove that there exists a power of three which ends with the digits 001 (in decimal notation)
Sol. If 3m and 3n (where m > n) are two powers of 3 which give the same remander when divided by
1000, then 3m(3m–n –1) is divisible by 1000. Now the prime factors of 1000 are 2 and 5, and neigher
divides 3n. It follows that 1000 must divide 3m–n–1, which means that 3m–n is a power of 3 ending in
the digits 001.
RECEUURNECE REALTIONS ASSIGNMENT 1

RECURRENCE RELATIONS
1. Find the solution for the recurrence relation
 x n = 6x n −1 − 9x n −2

x 0 = 2
x = 3
 1
2. Two persons A and B gamble dollars on the toss of a fair coin. A has $ 70 and B has $30. In each
play either A wins $1 from B or loss $1 to B. The game is played without stop until one wins all the
money of the other or goes forever. Find the probabilities of the following three possibilities :
(a) A wins all the money of B.
(b) A loss all his money to B.
(c) The game continues forever.
3. Consider the non homogeneous equation
 x n = 3x n −1 + 10x n −2 + 7.5n

x 0 = 4
x = 3
 1
4. Consider the non-homogonous equation
 x n = 10x n −1 − 25x n −2 + 8.5n

x 0 = 6
 x = 10
 1
5. Derive a RRwIC for dn, the number of sequence of he 26 upper case letters that do not Contin DOG.
6. Let a0 = 0, a1 = 1, an = 2an-1 + an-2(n  2). Prove that 2k |an if and only if 2k | n.
(Note: a | b express that b is divisible by a).
7. How many numbers of ways are there such that a 2  n chessboard can be perfect covered by n 1  2
rectangle without gaps and without overlaps?
8. Suppose a sphere is divided into an regions by n big circles on this sphere, no three of which are
concurrent. Find an.
9. How many n-digit numbers can be formed by the digits 1, 2, 3, 4 such that the number of the digit 1
is even?
10. Four men A, B, C and D pass a ball to each other satisfying the following requirement: every man
who accepts the ball pass this ball to any one of other three men at once. Suppose that a begin to pass
RECEUURNECE REALTIONS 2

the ball (as first time passing ball). In haw many distinct ways can the ball return to A after 10 passes
of the ball.
RECEUURNECE REALTIONS 3

SOLUTIONS
1. Find the solution for the recurrence relation
 x n = 6x n −1 − 9x n −2

x 0 = 2
x = 3
 1
Sol: The characteristic equation  (r –3)2 = 0
has only one root r = 3. Then the general solutions is
xn = c13n + c2n3n
The initial conditions x0 = 2 and x1 = 3 imply that c1 = 2 and c2 = –1. Thus
x n = 2.3n − n.3n = ( 2 − n ) 3n ,n  0
2. Two persons A and B gamble dollars on the toss of a fair coin. A has $ 70 and B has $30. In each
play either A wins $1 from B or loss $1 to B. The game is played without stop until one wins all the
money of the other or goes forever. Find the probabilities of the following three possibilities :
(a) A wins all the money of B.
(b) A loss all his money to B.
(c) The game continues forever.
Sol: Either A and B can keep track of the game simply by counting their own money. Their position n
(number of dollars) can be one of the n umbers 0, 1, 2,…, 100. Let Pn = probability that A reaches
100 at position n.
After one toss, A enters into either position n + 1 or position n – 1. The new probability that A
reaches 100 is either pn+1 or pn–1. Since the probability of A moving to position n + 1 or n –1 from is
1/2. We obtain recurrence relation
 1 1
 p n = p n +1 + p n −1
2 2

p0 = 0
p = 1
 100

The characterisic equation
r 2 − 2r + 1 = 0
has only one root r = 1. The general solutions is
pn = c1 + c2n.
Applying the boundary conditions p0 = 0 and p100 =1. We have
RECEUURNECE REALTIONS 4

1
c1 = 0 and c 2 =
100
Thus
n
Pn = , 0  n  100
100
n
Of course, p n = , n > 100 is nonsense to the original problem. The probabilities for (a), (b) and
100
(c) are 70%, 30% and 0 respectively
3. Consider the non homogeneous equation
 x n = 3x n −1 + 10x n −2 + 7.5n

x 0 = 4
x = 3
 1
Sol: The characteristic equation is
t 2 − 3t − 10 = 0  ( t − 5)( t + 2 ) = 0

4. Consider the non-homogonous equation

RECEUURNECE REALTIONS 5

 x n = 10x n −1 − 25x n −2 + 8.5n


x 0 = 6
 x = 10
 1
Sol: The characteristic equation

t 2 − 10t + 25 = 0  ( t − 5 ) = 0
2

We have roots r1 = r2 = 5 , then r = r1 = r2 = 5. A special solution can be of the type xn = An25n. Put the
solution into the non homogeneous relation. We the type xn = An25n. Put the solution into the non
homogeneous relation. We have

An 2 5n = 10A ( n − 1) 5n −1 − 25A ( n − 2 ) 5n −2 + 8.5n

2 2

Dividing both sides by 5n-2

An 2 52 = 10A ( n − 1) 5 − 25A ( n − 2 ) + 8.52

2 2

5. Derive a RRwIC for dn, the number of sequence of the 26 upper case letters that do not Contin DOG.
RECEUURNECE REALTIONS 6

Sol:

6. Let a0 = 0, a1 = 1, an = 2an-1 + an-2(n  2). Prove that 2k |an if and only if 2k | n.

(Note: a | b express that b is divisible by a).
Sol: The characteristic equation is r2 − 2r − 1 = 0, and the characteristic roots are rl.2 = 1 ± 2. So an = c1(l
1 1
+2)n + c2(1− 2)n. From a0 = 0, and a1 = 1, we know that C1 = , C2 = .
2 2 2 2
1 𝑛 1 𝑛
Thus 𝑎𝑛 = 2√2 (1 + √2) − 2√2 (1 − √2) .

Set (l + 2)n = An + Bn2 (An, Bn  N+), then (1 −2)n = An − Bn2, an =Bn, and An2 −2B n2 = (−1)n.
It implies An is odd. Let n = 2k (2t + 1) (k, t are nonnegative integers). Thus we need to prove that Bn
is a multiple of 2k but not 2k + l. We prove by induction on n. When k = 0, then n = 2t + 1 is odd, and
An is also odd, so 2B n2, = A n2 +1  2 (mod 4). Thus Bn is odd, and it means that Bn is a multiple of
20 but not 21. Assume that when k = m, Bn is a multiple of 2m but not 2m+1 , and when k = m + 1,
with (An + Bn 2)2 = (1 +2)2n = A2n + 2B2n , we obtain B2n = 2AnB2n and since An is odd, B2m is a
multiple of 2m+1 but not 2m+2 , and 2n = 2k+1 (2t + 1). Therefore, we complete the proof.
7. How many numbers of ways are there such that a 2  n chessboard can be perfect covered by n 1  2
rectangle without gaps and without overlaps?
RECEUURNECE REALTIONS 7

Sol: Assume that there are an distinct ways. Obviously, a1 = 1, a2 = 2. When the chessboard is 2  n, if we
use 1  2 rectangles to cover two small squares on the leftmost column, then there are an-1 distinct
ways to cover the remaining 2  (n - 1) rectangles on the chessboard, and if we use two 1  2
rectangles to cover the leftmost 2  2 square on the chessboard, then there are an-2 distinct ways to
cover the remaining 2  (n – 2) rectangles on the chessboard. Thus an = an-1 + an-2. We obtain

1  1 + 5  1− 5  
n +1 n +1

an =   −   
5  2   2  

8. Suppose a sphere is divided into an regions by n big circles on this sphere, no three of which are
concurrent. Find an.
Sol: Obviously, a1 = 2. Since the sphere is divided into an-1 regions by n – 1 big circles, and no three of
circles are concurrent, the number of intersecting points of the nth great circle and the n – 1 big
circles is 2 (n – 1) and the nth big circle is divided into 2 (n – 1) arcs by these intersecting points.
Hence each original region is divided into two regions by these arcs, and the number of incremental
regions is 2 (n – 1), and this is an = an-1 + 2(n – 1). Therefore
n n
an = a1 +  ( ak − ak −1 ) = 2 + 2 ( k − 1)
k =2 k =2

n ( n − 1)
= 2+ 2• = n2 − n + 2 .
2
9. How many n-digit numbers can be formed by the digits 1, 2, 3, 4 such that the number of the digit 1
is even?
Sol: Obviously, a1 = 3. Among the n-digit numbers satisfying the given conditions, the number of n-digit
numbers with leading digit 1 is 4n-1− an-1 and the number of n-digit numbers with leading digit k = 2,
3 or 4 is 3an-1, thus
𝑎𝑛 = 4𝑛−1 − 𝑎𝑛−1 + 3𝑎𝑛−1 = 2𝑎𝑛−1 + 4𝑛−1
𝑎 1 𝑎 1 an 1 1
Both sides are divided by 4𝑛 : 4𝑛𝑛 = 2 . 4𝑛−1
𝑛−1
+ 4, and set bn = n
then bn = bn −1 + ,
4 2 4
1 1 1
i,e. bn − =  bn −1 − 
2 2 2
So
n −1 n −1
1  1  1   3 1  1  1
bn − =  b1 −   =  −   = .
2  2  2   4 2  2  2n +1
RECEUURNECE REALTIONS 8

Therefore
 1 1 1
an = 4n bn = 4n  n +1 +  = ( 2n + 4n ) .
2 2 2
10. Four men A, B, C and D pass a ball to each other satisfying the following requirement: every man
who accepts the ball pass this ball to any one of other three men at once. Suppose that a begin to pass
the ball (as first time passing ball). In haw many distinct ways can the ball return to A after 10 passes
of the ball.
Sol: Assume that the ball returns to A after n times in an distinct ways. It can be easily concluded that a1 =
0, and a2 = 3 and there are 3n-1 distinct ways to pass the ball n – 1 times continually. These ways are
divided into two classes: (1) the ball returns to A after the (n – 1)th times in an-1 distinct ways and (2)
the ball is passed to one of B, C, D after the (n – 1)th times but the ball returns to A after the nth time
an 1 an −1 1 a 1 1
in an distinct ways . Hence an-1 + an = 3n-1, i.e. n
+ . n −1 = , Set bn = nn , thus bn + 3 𝑏𝑛−1 = 3,
3 3 3 3 3
1 1
i.e. bn − 4 . (𝑏𝑛−1 − 4).

1 1
(Note that 1/4 is the root of the equation x + x = ) Hence
3 3
n −1 n −1
1  1  1  1  1 
bn − =  b1 −   −  =  −  − 
4  4  3  4  3 
 1  1 n −1 1  1 n
an = 3 bn = 3  −  −  +  = 3 + ( −1) 3
n n n
( )
 4  3  4  4

Especially, a10 =
4
(
1 10
)
3 + ( −1) 3 = 14763 .
10
2 MARKER - 1 ASSIGNMENT 1

1. Consider the network of equally spaced parallel lines (6 horizontal and 9 vertical) shown in the
figure. All small squares are of the same size. A shortest route from A to C is defines as a route
consisting 8 horizontal steps and 5 vertical steps.

(a). The number of shortest routes through the junction P is:

(b) The number of shortest routes which go following street PQ must be
(c) The number of shortest routes which passes through junction P and R
2. There are 16 men sitting on a round table. Find the number of ways to select 7 men such that no two
are consecutive.
3. How many garlands of 6 flowers of different colours be made out of 10 flowers of different colors?
4. In how many ways a team of 11 cricket players may sit on a round table so that captain, vice captain
& wicket keeper are together.
5. Find the number of ways in which seven persons can be arranged at a round table if two particular
persons may not sit together.
6. Suppose 40 objects are placed along a circle at equal distances. In how many ways can 3
objects be chosen from among them so that no two of the three chosen objects are adjacent nor
diametrically opposite?
7. In how many ways can 12 gentlemen sit around a round table so that three specified gentlemen are
always together
(a) 9 ! (b) 10 ! (c) 3 ! 10 ! (d) 3 ! 9 !
8. The number of ways in which 6 men and 5 women can dine at a round table if no two women are to
sit together is given by
(a) 6! × 5! (b) 30 (c) 5! × 4! (d) 7! × 5!
2 MARKER - 1 2

Answers Key
1. (560, 350, 240) 2. ( 8C6 16 / 7 ) 3. (12600) 4. (241920)
5. (480) 6. () 7. (d) 8. (a)

Solutions
1. Consider the network of equally spaced parallel lines (6 horizontal and 9 vertical) shown in the
figure. All small squares are of the same size. A shortest route from A to C is defines as a route
consisting 8 horizontal steps and 5 vertical steps.

(a). The number of shortest routes through the junction P is:

(b) The number of shortest routes which go following street PQ must be
(c) The number of shortest routes which passes through junction P and R
Ans. 560, 350, 240
Sol. (a) 5C2⨯8C3 = 560
(b) 5C2⨯7C3 = 350
(c) 5C2⨯4C1⨯4C2 = 240

2. There are 16 men sitting on a round table. Find the number of ways to select 7 men such that no two
are consecutive.
Ans. 8
C6 16 / 7
Sol. Number of ways to select one man = 16C1
⇒ Adjacent men of that man can’t come.
To select 6 more from remaining 13 = 8C6
Each selection repeated 7 times.
16
C1 8C6
Ways =
7

3. How many garlands of 6 flowers of different colours be made out of 10 flowers of different colors?
Ans: (12600)
2 MARKER - 1 3

Sol: Given, 10 flowers and garland of 6 flowers has to be prepared

Number of ways

= 10C6 .
( 6 − 1)!
2
5!
= 10C6
2
= 12600

4. In how many ways a team of 11 cricket players may sit on a round table so that captain, vice captain
& wicket keeper are together.
Ans: (241920)
Sol: We want captain, vice-captain and wicket keeper to be together
Thus assuming them as 1 and arrange with remaining 8 players
Total number of ways
= ( 9 − 1) ! 3!
= 8! 3!
= 241920

5. Find the number of ways in which seven persons can be arranged at a round table if two particular
persons may not sit together.
Ans: (480)
Sol: Number of ways in which 7 persons can be arranged at a round table if two particular person may
not sit together
= Total arrangement – when two particular person are together
= ( 7 − 1) !− ( 6 − 1) !2!
= 6!− 5!2
= 720 − 240
= 480

6. Suppose 40 objects are placed along a circle at equal distances. In how many ways can 3
objects be chosen from among them so that no two of the three chosen objects are adjacent nor
diametrically opposite?
Sol: One can choose 3 objects out of 40 objects in 40 3 ways. Among theese choices all would be together
in 40 cases; exactly two will be together in 40 × 36 cases. Thus three objects can be chosen such that
no two adjacent in 40 3 - 40 - (40 × 36) ways. Among these,
furthrer, two objects will be diametrically opposite in 20 ways and the third would be on either
semicircle in a non adjacent portion in 40 - 6 = 34 ways. Thus required number is
 40 
  − 40 − ( 40  36 ) − ( 20  34 ) = 7720
3
2 MARKER - 1 4

7. In how many ways can 12 gentlemen sit around a round table so that three specified gentlemen are
always together
(a) 9 ! (b) 10 ! (c) 3 ! 10 ! (d) 3 ! 9 !
Ans: (d)
Sol: Make a block of the three gentleman, now arrange 9!. Arrange gentlemen in block in 3! Ways.
Number of ways = 3!9!

8. The number of ways in which 6 men and 5 women can dine at a round table if no two women are to
sit together is given by
(a) 6! × 5! (b) 30 (c) 5! × 4! (d) 7! × 5!
Ans: (a)
Sol: Arrange 6 men in 5! Ways. Now place the women in between spaces in 6C5 x 5! Ways.
Number of ways = 5! X 6C5 x 5!