Title: Permutation & Combination

Chapter: Permutation & Combination

Approximate Time to Complete (to be filled by student): ________________________
Total Marks Scored:
Worksheet Compiled By: Prashant Jain (PJ Sir)

• Attempt the worksheet in one go. See answers in one go at the end.
• All questions carry 4 marks for positive and -1 if you leave and -2 if you attempt
incorrectly.
• All proving or show questions (if done correctly) are of 4 marks. There is no negative
marking.
• If you cheat in worksheet then you are only cheating and such sinners do not get
selection in JEE so for your own sake refrain from cheating.
• Maintain the solutions of this worksheet and share the link of solution pdf in the
tracker if you want to be monitored.

Exercise – I

1. How many positive integers are there such that n is a divisor of one of the numbers 1040, 2030?

2. Six cards are drawn one by one from a set of unlimited number of cards, each card is marked
with numbers − 1, 0 or 1. Number of different ways in which they can be drawn if the sum of
the numbers shown by them vanishes, is:

3. A five letter word is to be formed such that the letters appearing in the odd numbered positions
are taken from the letters which appear without repetition in the word "MATHEMATICS".
Further the letters appearing in the even numbered positions are taken from the letters which
appear with repetition in the same word "MATHEMATICS". The number of ways in which the
five letter word can be formed is:

4. In how many ways 4 square are can be chosen on a chess-board, such that all the squares lie in
a diagonal line.

5. Find the number of functions f : A → B where n(A) = m , n(B) = t , which are non decreasing,

6. Find the number of ways of selecting 3 vertices from a regular polygon of sides ‘2n+1’ with
vertices A1, A2, A3,......, A2n+1 such that centre of polygon lie inside the triangle.

7. A operation * on a set A is said to be binary, if x * y  A , for all x, y  A, and it is said to be

commutative ,
if x * y = y * x for all x, y  A. Now if A = {a1, a2, ......, an}, then find the following -
(i) Total number of binary operations of A
(ii) Total number of binary operation on A such that
ai * aj  ai * ak, if j  k.
(iii) Total number of binary operations on A such that ai * aj < ai * aj+1  i, j

8. The integers from 1 to 1000 are written in order around a circle. Starting at 1, every fifteenth
number is marked (that is 1, 16, 31, .... etc.). This process in continued untill a number is reached
which has already been marked, then find number of unmarked numbers.

9. Find the number of ways in which n ‘1’ and n ‘2’ can be arranged in a row so that upto any point
in the row no. of ‘1’ is more than or equal to no. of ‘2’
10. Find the number of positive integers less than 2310 which are relatively prime with 2310.

11. In maths paper there is a question on "Match the column" in which column A contains 6 entries
& each entry of column A corresponds to exactly one of the 6 entries given in column B (and
vice versa) written randomly. 2 marks are awarded for each correct matching & 1 mark is
deducted from each incorrect matching. A student having no subjective knowledge decides to
match all the 6 entries randomly. Find the number of ways in which he can answer, to get atleast
25 % marks in this question.

12. Find the number of positive unequal integral solution of the equation x + y + z = 20.

13. If we have 3 identical white flowers and 6m identical red flowers. Find the number of ways in
which a garland can be made using all the flowers.

14. Number of times is the digit 5 written when listing all numbers from 1 to 105?

15. The number of combinations of n letters together out of 3n letters of which n are a and n are b
and the rest unlike.

16. In a row, there are 81 rooms, whose door no. are 1,2,.......,81, initially all the door are closed. A
person takes 81 round of the row, numbers as 1st round, 2nd round ........ 81th round. In each
round, he interchage the position of those door number, whose number is multiple of the round
number. Find out after 81st round, How many doors will be open.

17. Mr. Sibbal walk up 16 steps, going up either 1 or 2 steps with each stride there is explosive
material on the 8th step so he cannot step there. Then number of ways in which Mr. Sibbal can
go up.

18. Number of numbers of the form xxyy which are perfect squares of a natural number.

19. A batsman scores exactly a century by hitting fours and sixes in twenty consecutive balls. In
how many different ways can he hit either six or four or play a dot ball?

20. In how many ways can two distinct subsets of the set A of k(k  2) elements be selected so that
they have exactly two common elements.

21. How many 5 digit numbers can be made having exactly two identical digit.

22. Find the number of 3-digit numbers. (including all numbers) which have any one digit is the
average of the other two digits.

23. In how many ways can(2n + 1) identical balls be placed in 3 distinct boxes so that any two boxes
together will contain more balls than the third box.

24. Let f(n) denote the number of different ways in which the positive integer 'n' can be expressed
as sum of 1s and 2s.
for example f(4) = 5 {2 + 2, 2 + 1 + 1, 1 + 2 + 1, 1 + 1 + 2, 1 + 1 + 1 + 1}. Now that order of 1s
and 2s is important. Then determine f(f(6))

25. Prove that (n!)! is divisible by (n!)(n–1)!

26. A user of facebook which is two or more days older can send a friend request to some one to
join facebook.
If initially there is one user on day one then find a recurrence relation for an where an is number
of users after n days.

27. Let X = {1, 2, 3,.....,10}. Find the the number of pairs {A, B} such AX. B X. A  B and
A  B = {5,7,8}.

28. Consider a 20-sided convex polygon K, with vertices A1, A2, . . . . , A20 in that order. Find the
number of ways in which three sides of K can be chosen so that every pair among them has at
least two sides of K between them. (For example (A1A2, A4A5, A11A12) is an admissible triple
while (A1A2, A4A5, A19A20) is not).

29. Find the number of 4-digit numbers (in base 10) having non-zero digits and which are divisible
by 4 but not by 8.

30. Find the number of all integer-sided isosceles obtuse-angled triangles with perimeter 2008.

31. Let ABC be a triangle. An interior point P of ABC is said to be good if we can find exactly 27
rays emanating from P intersecting the sides of the triangle ABC such that the triangle is divided
by these rays into 27 smaller triangles of equal area. Determine the number of good points for a
given triangle ABC.

32. Let  = (a1, a2, a3, ..., an) be a permutation of (1, 2, 3, ..., n). A pair (ai, aj) is said to correspond
to an inversion of , if i < j but ai > aj. (Example : In the permutation (2, 4, 5, 3, 1), there are 6
inversions corresponding to the pairs (2, 1), (4, 3), (4, 1), (5, 3) (5, 1), (3, 1) . ) How many
permutations of (1, 2, 3, ... n), (n  3), have exactly two inversions.?
 Answer Key
Exercise – I

1. 2301 2. 141 3. 540 4. 364 5. (t +m−1)cm ways

2𝑛+1 2
6. (2𝑛𝑐2 − 3𝑛𝑐2 . ) 7. (i) 𝑛𝑛 (ii) (n!)n (iii) 1
3
2𝑛 𝐶
𝑛
8. 800 9. 10. 480 11. 56 ways 12. 144
𝑛+1
13. 3m2 + 3m + 1 14. 50000 15. (n + 2). 2n−1 16. 9
20! 20! 20! 20! 𝑘(𝑘−1)
17. 441 18. 1 19. + + + 20. ((3)𝑘−2 − 1)
10!10! 7!12! 4! 16!3! 4
𝑛(𝑛+1)
21. 45360 22. 121 23. 24. 377 26. an = an–1 + an–2
2
27. 2186 28. 520 29. 729 30. 86 31. 26C2
(𝑛+1)(𝑛−2)
32.
2