Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

IOQM Mock 3

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

IOQM Mock 3

piyush kumar jha


August 22, 2023

The Mock is designed as per the recent pattern of IOQM, the level of
problems are same as that of harder IOQM in recent years,
Answer to all problems ranges from 0-99 and the Maximum time to complete
this mock is 3hours. Be honest with yourself towards this Mock, Happy
Solving!

Contents
1 2 markers 1

2 3 markers 2

3 5 marker 3

§1 2 markers
Problem 1.1. All diagonals of a convex pentagon are drawn, dividing it in one smaller
pentagon and 10 triangles. Find the maximum number of triangles with the same area
that may exist in the division.
Problem 1.2. If
       
X 17 17 17 k
· · =
a b c n
a+b+c=5, a, b, c≥0

, where k, n are relatively prime positive integers such that k > n, compute k + n.
Problem 1.3. A, B, C, D, E, F are on a circle in this order and the segments
AD, BE, CF intersect at one point. If AB = 1, BC = 2, CD = 3, DE = 4, EF = 5,
then if the length of the segment F A is m , Compute 8m.
Problem 1.4. The circle C1 is tangent to the circle C2 internally at the point A. Let O
be the center of C2 . The point P is on C1 and the tangent line at P passes through O.
Let the ray OP intersects with C2 at Q, and let the tangent line of C1 passing through
A intersects with the line OP at R. If the radius of C2 is 9 and P Q = QR, then find the
length of the segment OP .
Problem 1.5. Let 1 ≤ a, b, c, d, e, f, g, h, i ≤ 9 be distinct integers. Denote by N
the maximum value of a ∗ b ∗ c, d ∗ e ∗ f, g ∗ h ∗ i. Find the possible minimum value of N .

1
piyush kumar jha — August 22, 2023 IOQM Mock 3

Problem 1.6. Let A be a positive integer which is a multiple of 3, but isn’t a multiple
of 9. If adding the product of each digit of A to A gives a multiple of 9 and the possible
minimum value of A is N , find sum of digits of N .
Problem 1.7. A diameter CD of a circle is extended through D to external point P .
The measure of secant CP is 77. From P , another secant is drawn intersecting the
circle first at A, then at B. The measure of secant P B is 33. The diameter of the circle
measures 74. Find the measure of the angle formed by the secants.
Problem 1.8. Let G be the sum of all positive integers n such that the product of all
positive divisors of n is 24240 . Find highest power of 2 dividing G.
 1000000 
Problem
j k 1.9. Let L denote the set of all positive integers n such that n −
1000000
n+1 = 1. Find smallest prime factor of |L|.

Problem 1.10. Given a triangle ABC with circumcenter O. Let D ∈ AB, E ∈ AC such
that AD = 8, BD = 3 and AO = 7. If O is the midpoint of DE, then find 21(CE)2 .

§2 3 markers
Problem 2.1. Consider a triangle ABC with AB = 13, BC = 14, CA = 15. A line
perpendicular to BC divides the interior of △ BC into two regions of equal area. Suppose
that the aforesaid perpendicular cuts BC at D, and cuts △ ABC again at E. If L is the
length of the line segment DE, find L2 .
Problem 2.2. Let a, b, c and d be real numbers such that

(a + b)(c + d) = 2

(a + c)(b + d) = 3

(a + d)(b + c) = 4

Find the minimum possible value of the expression

a2 + b2 + c2 + d2 .
Problem 2.3. Let ω be an incircle of triangle ABC. Let D be a point on segment
BC, which is tangent to ω. Let X be an intersection of AD and ω against D. If
AX : XD : BC = 1 : 3 : 10, a radius of ω is 1, find the length of segment (XD)2 . Note
that Y Z expresses the length of segment Y Z.
Problem 2.4. In a tournament each player played exactly one game against each of the
other players. In each game the winner was awarded 1 point, the loser got 0 points, and
each of the two players earned 1/2 point if the game was a tie. After the completion of
the tournament, it was found that exactly half of the points earned by each player were
earned against the ten players with the least number of points. (In particular, each of
the ten lowest scoring players earned half of her/his points against the other nine of the
ten). What was the total number of players in the tournament?
Problem 2.5. For each x in [0, 1], define
(
2x, if 0 ≤ x ≤ 21 ;
f (x) =
2 − 2x, if 21 < x ≤ 1.

2
piyush kumar jha — August 22, 2023 IOQM Mock 3

Let f [2] (x) = f (f (x)), and f [n+1] (x) = f [n] (f (x)) for each integer n ≥ 2. Suppose that
for V many values of x the equation f [2023] (x) = 12 is true for x ∈ [0, 1]. Find the Sum of
digits of V .
Problem 2.6. Let S be the set of all points with coordinates (x, y, z), where x, y, and
z are each chosen from the set {0, 1, 2}. How many equilateral triangles have all their
vertices in S?
Problem 2.7. Let P (x) = (x − 1)(x − 2)(x − 3). For how many polynomials Q(x) does
there exist a polynomial R(x) of degree 3 such that P (Q(x)) = P (x) · R(x)?
Problem 2.8. Let a, b and c be the distinct solutions to the equation x3 −2x2 +3x−4 = 0.
If the value of
1 1 1 m
+ + =
a(b2 2 2 2 2 2 2 2 2
+ c − a ) b(c + a − b ) c(a + b − c ) n

, where m, n are relatively prime positive integers , Compute n − m.


Problem 2.9. Consider the following three lines in the Cartesian plane:

ℓ1 : 2x − y = 7

ℓ2 : 5x + y = 42

ℓ3 : x + y = 14

and let fi (P ) correspond to the reflection of the point P across ℓi . Suppose X and Y
are points on the x and y axes, respectively, such that f1 (f2 (f3 (X))) = Y . Let t be the
length of segment XY ; what is the sum of all possible values of t?
Problem 2.10. Determine the number of ordered pairs of positive integers (m, n) with
1 ≤ m ≤ 100 and 1 ≤ n ≤ 100 such that

gcd(m + 1, n + 1) = 10 gcd(m, n).

§3 5 marker
Problem 3.1. If there distinct real numbers α, β, γ that satisfy:

α3 − 6αj2 + 17α − 3 2 3 2
k 29 = 0, β − 9β + 32β − 31 = 0, γ + 3γ + 8γ − 5 = 0 respectively.
Compute 2α+β−γ
β+γ .

Problem 3.2. There are S number of 73 digits numbers chosen from the set {2, 3, 7, 9}
and are divisible by 3. Find sum of digits of S.
Problem 3.3. Let M AT H be a trapezoid with M A = AT = T H = 5 and M H = 11.
Point S is the orthocenter of △AT H. Compute the area of quadrilateral M ASH.
Problem 3.4. Let △ABC be a triangle with side lengths a, b, and c. Circle ωA is
the A-excircle of △ABC, defined as the circle tangent to BC and to the extensions
of AB and AC past B and C respectively. Let TA denote the triangle whose vertices
are these three tangency points; denote TB and TC similarly. Suppose the areas of
TA , TB , and TC are 4, 5, and 6 respectively. If a, b, c are positive integers such that
gcd(a, b) = gcd(b, c) = gcd(a, c) = 1. Compute a + b + c.

3
piyush kumar jha — August 22, 2023 IOQM Mock 3

Problem 3.5. On Misha’s new phone, a passlock consists of six circles arranged in a
2 × 3 rectangle. The lock is opened by a continuous path connecting the six circles; the
path cannot pass through a circle on the way between two others (e.g. the top left and
right circles cannot be adjacent). For example, the left path shown below is allowed but
the right path is not. (Paths are considered to be oriented, so that a path starting at A
and ending at B is different from a path starting at B and ending at A. However, in
the diagrams below, the paths are valid/invalid regardless of orientation.) If J many
passlocks are there consisting of all six circles. Find remainder when J is divided by 41.

Problem 3.6. Catherine has a plate containing 300 circular crumbling mooncakes,
arranged as follows:

(This continues for 100 total columns). She wants to pick some of the mooncakes to
eat, however whenever she takes a mooncake all adjacent mooncakes will be destroyed
and cannot be eaten. Let M be the maximal number of mooncakes she can eat, and let
n be the number of ways she can pick M mooncakes to eat (Note: the order in which
she picks mooncakes does not matter). Compute the remainder when M + n is divided
by 100.
Problem 3.7. Find sum of all positive integers n > 2 such that
Y
n! | (p + q)
p<q≤n,p,q primes

Problem 3.8. Let A1 A2 A3 A4 be a non-cyclic quadrilateral. Let O1 and r1 be the


circumcentre and the circumradius of the triangle A2 A3 A4 . Define O2 , O3 , O4 and
r2 , r3 , r4 in a similar way. Compute
1 1 1 1
+ + + .
O1 A21 − r12 O2 A22 − r22 O3 A23 − r32 O4 A24 − r42

Problem 3.9. Find number of pairs of integers a, b for which there exists a polynomial
P (x) ∈ Z[X] such that product (x2 + ax + b) · P (x) is a polynomial of a form

xn + cn−1 xn−1 + · · · + c1 x + c0

where each of c0 , c1 , . . . , cn−1 is equal to 1 or −1.


Problem 3.10. Find the number of ordered triples of positive integers (a, b, c) such that
abc divides (ab + 1)(bc + 1)(ca + 1).

You might also like