OMC IOQM Mock

OMC

February 11, 2022

§1 Instructions

1. There are two parts to this test, which are exclusive. You can attend any one or both the
parts and at one go, or at different times.

2. Part A has 12 questions meant to be attempted fro 75 minutes. All the answers are between
00 and 99 (both included). Part B is a subjective test where the proofs are meant be written
and uploaded. There are three questions and the time limit is 150 minutes.

3. Both parts can be submitted through the google forms provided at the beginning of each
part. Part A will be graded automatically and you can see the answers after submitting the
test. Part B may or may not be graded depending on the number of submissions.

4. The deadline for submission is February 19 (Saturday) at 23:59 IST. The solutions for both
parts will be released then. We may hold hold a session discussing the questions in this paper
at a later date.

5. If you have questions, you can ask on the OMC discord server (if you aren’t there, join using
https://discord.gg/hrbPY3Yn8Y) or write a mail to onlinemathclub4@gmail.com and we
will try to get back to you as soon as we can.

1
 2

§2 Part A

Please submit the solutions to this at https://forms.gle/1H2Vvc2jfsN4pM5G9 (open this in a new

page). The time limit is 75 minutes. All the questions have the same points. They are arranged
roughly in increasing order of difficulty.

Problem 1
Find the number of possible values of gcd(7n2 + 4, 3n2 + 2).

Problem 2
Consider a triangle ABC and points X,Y and Z on BC, AC and AB. Let the circles BXZ and
CYX meet at O. Suppose that ∠OXB = 90 and ∠ZOY = 120, then find angle A.

Problem 3
Let A be the set of all the numbers between 10 and 10000 which are palindromes. Varun picks
a number out of A randomly. What is the probability that the number is divisible by 11? if the
a
answer is b where a and b are coprime, find b(a + b)/10c.

Problem 4
What is the maximum possible length of a sequence of numbers such that the sum of any 19
continuous numbers is negative whereas the sum of any 22 continuous numbers is positive?

Problem 5
If P (x) intersects the x-axis 5 times and P (x) is a polynomial with real coefficients such that
αP (x2 )P (x + 2) = x9 P (x2 + 5) + c for some constants α and c. Then how many irreducible
quadratic polynomials divide P (x)?

Problem 6
Let ABCDEF be a regular hexagon. Let P be a point inside the haxagon such that the the
perpendiculars to the 6 sides, in some order, are 4, 5, 7, 4, 5 and 2. If BC=x, then find bxc

Problem 7
For how many natural numbers n less than 1000 is n5 + n4 + 1 a prime?
 3

Problem 8
Suppose that there are 80 × 109 people in the world. All the people in the world arrange
themselves uniformly on the surface of the Earth such that each person is adjacent to 4 other
people. Then each person gives a gift to one of the 4 people adjacent to them at random. What
is the expected number of people who get a gift? If the answer is n × 109 , then what is bnc?

Problem 9
p √
Consider two sequences an , bn such that a0 = 3, b0 = 6 and an+1 = an bn+1 and bn+1 = an bn .
If the limits of the two sequences as n goes to ∞ are equal and equal to x, find x3 .

Problem 10
What is the maximum number of rooks that can be placed in 3D chessboard of size 5 × 5 × 5
such that none of them attack each other?

Problem 11
Consider a right angled triangle ABC with ∠ABC = 90. We have AB=3 and BC=4. Let I be
the incentre and the let the line passing through I and parallel to AB intersect the incircle at E,
where E is not on BC. If AE intersects BC at F, find the value of 2*EF2 .

Problem 12
If ∞ 19n+81 2 n a
P
n=1 27n(n+3) ( 3 ) = b where a,b are coprime, find b(a + b)/10c.
 4

§3 Part B

You can find the google form here: https://forms.gle/9Fu2aKppvMYvEwjx7

Either upload the solutions or share links to the the solutions (but make sure we have the right
permissions).

Problem 1
For all integers n, let σ(n) be the sum of divisors of n and φ(n) be the numbers of natural
numbers less than n and coprime to it. Prove that σ(n) + φ(n) ≥ 2n

Problem 2
There are 2001 towns in a country which are connected by some roads. There is at least one
road from each town, so that no town is connected by a road to every other city. We call a set
D of towns dominant if every town not in D is connected by a road to a town in D. Suppose
that each dominant set consists of at least k towns. Prove that the country can be partitioned
into 2001 − k republics in such a way that no two towns in the same republic are connected by
a road.

Problem 3
The excircle of right-angled triangle ABC (∠B = 90o ) touches side BC at point A1 and touches
line AC in point A2 . Line A1 A2 meets the incircle of ABC for the first time at point A0 , point
C 0 is defined similarly. Prove that AC||A0 C 0 .