Level 6U - Combinatorics θ - Module Test
(Linear and Circular Permutations, Combinations and Bijection Principle, Arrangements
and Selections with Repetition, Binomial Theorem and its Coefficients, Pascal Triangle,
Hockey Stick identity, Multinomial Theorem and its coefficients, Pigeon - Hole Principle
and Constructive Counting)
Total marks - 100
Math Olympiad Program
[Link]
April 26, 2025
1/1
Instructions
1. Please make sure that there are total 10 problems in this paper.
2. The Time limit for this exam is 1 hour and 30 minutes. Submissions after that will not be
evaluated.
3. Write your solution in an A4 sheet, scan it upstraight and upload the solutions page-wise
in the google classroom. Else the submission will not be evaluated. Skipping the essential
proofs will not get full credit.
4. Out of the total 10 problems, answering completely any 5 of them will give you
full marks for this paper. Only 5 problems will be evaluated, so there is no use of
answering more than 5 problems.
5. Do not attempt to search for the solutions online as you are proctored and all
solutions available online are available to us as well, so we would easily identify
you if you try to see solutions online. Those people will be directly removed from
this batch.
2 / 12
Problem 1
20 Marks
In each of the following 7-digit natural numbers: 1001011, 5550000, 3838383, 7777777, every
digit in the number appears at least 3 times. Let N be the number of such 7-digit natural
numbers. Find the remainder when N is divided by 1000 .
3 / 12
Problem 2
20 Marks
In the Street Map of a city given below, Find the total number of shortest paths from A to B.
Figure: Street Map of a city 4 / 12
Problem 3
20 Marks
How many different 4 × 4 arrays whose entries are all 10 s and −10 s have the property that
both the sum of the entries in each row is 0 and the sum of the entries in each column is 0 ?
5 / 12
Problem 4
20 Marks
Prove that among any 16 distinct positive integers not exceeding 100 there are four different
ones, a, b, c, d, such that a + b = c + d.
6 / 12
Problem 5
20 Marks
Delegates from 9 countries including countries A, B, C , D are to be seated in a row. How many
different seating arrangements are possible if the delegates of countries A and B are to be
seated next to each other and the delegates of countries C and D are not to be seated next to
each other? How will the answer change if the seating is done at a round table? (You need not
evaluate the final answer, just leave it interms of the factorial)
7 / 12
Problem 6
20 Marks
There are 43 different time periods during which classes at a university can be scheduled. If
there are 677 different courses which lasts for one class, what is the minimum number of
different rooms that will be needed to accommodate all the classes? (Assume that no two
classes can happen in the same class in the same time slot)
8 / 12
Problem 7
20 Marks
Let the set S = {P1 , P2 , . . . , P12 } consist of the twelve vertices of a regular 12-gon. A subset
Q of S is called “communal” if there is a circle such that all points of Q are inside the circle,
and all points of S not in Q are outside of the circle. How many communal subsets are there?
(Note that the empty set is a communal subset.)
9 / 12
Problem 8
20 Marks
Into how many regions do the diagonals of a convex 10-gon divide the interior if no three
diagonals are concurrent inside the 10 -gon? Also in how many points do they intersect in the
interior?
10 / 12
Problem 9
20 Marks
Five girls and eleven boys (both boys and girls are distinct) are to be lined up in a row such
that from left to right, the girls are in the order: G1 , G2 , G3 , G4 , G5 . In how many ways can this
be done if G1 and G2 must be separated by at least 3 boys, and there is at most one boy
between G4 and G5 ?
11 / 12
Problem 10
20 Marks
Find the GCD( Greatest Common Divisor) of the following 8 numbers,
90 91 92 93 94 95 96 97
, , , , , , ,
7 7 7 7 7 7 7 7
12 / 12
