IOQM 2022 Solution

Time : 3 Hours Number of Question : 24 Max.
Marks : 100
INSTRUCTIONS
1. Use of mobile phones, smart phones. ipads, calculators, programmable wrist watches is
STRICTLY PROHIBITED. Only ordinary pens and pencils arc allowed inside the examination
hall.
2. The correction is done by machines through scanning. On the OMR Sheet, darken bubbles
completely with a black or blue ball pen. Please DO NOT use a pencil or a gel pen. Darken the
bubbles completely, only after you are sure of your answer; else, erasing may lead to the OMR
sheet getting damaged and the machine may not be able to read the answer. .
3. Incompletely, incorrectly or carelessly filled information may disqualify your candidature.
4. Each question has a one or two digit number as answer. The first diagram below shows improper
and proper way of darkening the bubbles with detailed instructions.
The second diagram shows how to mark a 2-digit number and a 1-digit number.
5. The answer you write on OMR sheet is irrelevant. The darkened bubble will be considered as
your final answer.
6. Questions 1 to 10 carry 2 marks each; questions 11 to 22 carry 5 marks each; questions 23 and 24
carry 10 marks each.
7. All questions are compulsory.
8. There are no negative marks.
9. Do all rough work in the space provided below for it. You also have blank pages at the end of the
question paper to continue with rough work.
10. After the exam, you may take away the Candidate's copy of the OMR sheet.
11. Preserve your copy of OMR sheet till the end of current olympiad season. You will need it later
for verification purposes.
12. You may take away the question paper after the examination.
Address : 'Reliable Institute', A-10 Road No.1, IPIA, Kota-324005 (Rajasthan), INDIA
visit us at: www.reliablekota.com, Email: info@reliablekota.com 1
Call us: +91-744-2665544
1. A triangle ABC with AC = 20 is inscribed in a circle . A tangent t to  is drawn through B. The
distance of t from A is 25 and that from C is 16. If S denotes the area of the triangle ABC, find the
largest integer not exceeding S/20.
Ans. 10
Sol.
From sine rule A
16cosecA 25cosec C

sin A sin C
sin 2 C 25
 
sin 2 A 16 C
16 cosecA
sin C 5 C A B
 
sin A 4
Now,
1
Area S = × 20 × 16 cosecA · sinC
2
5
= 10 × 16 × = 200
4
S
  10
20
AP 61
2. In a parallelogram ABCD, a point P on the segment AB is taken such that  and a point
AB 2022
AQ 61 AC
Q on the segment AD is taken such that  . If PQ intersects AC at T, find to the
AD 2065 AT
nearest integer.
Ans. 67
Sol. AP = 61x , PB = 1961x
AQ = 61y, QD = 2004y
AQP  DQR
AQ AP R D
  C
DQ RD
 RD = 2004x 2004 y
Now, Q
ATP  CTR T
61y
AT AP

CT CR A 61x P 1961x B
CT 4026
 
AT 61
AC 4087
   67
AT 61
2 visit us at: www.reliablekota.com, Email: info@reliablekota.com
Call us: +91-744-2665544
3. In a trapezoid ABCD, the internal bisector of angle A intersects the base BC (or its extension) at
the point E. Inscribed in the triangle ABE is a circle touching the side AB at M and side BE at the
point P. Find the angle DAE in degrees, if AB : MP = 2.
Ans. 60
Sol. AE || DC
 BAE = BEA = 
 AB = BE
 a=c
Now, MP divides BA and BE in same ratio
 MP || AE A D
AB a  b 
Given PM =  a  a
2 2
ABE  MBP M
AB AE b c
  
MB MP C
B b P c E
ab 2a
 
b ab
2
 a=b
  = 60°
4. Starting with a positive integer M written on the board, Alice plays the following game: in each
move, if x is the number on the board, she replaces it with 3x + 2. Similarly, starting with a
positive integer N written on the board, Bob plays the following game: in each move, if x is the
number on the board, he replaces it with 2x + 27. Given that Alice and Bob reach the same
number after playing 4 moves each, find the smallest value of M + N.
Ans. 10
Sol. Alice:
1st 2nd 3rd
M  3M + 2  3(3M + 2) + 2 = 9M + 8  3(9M + 8) + 2 = 27M + 26
 3(27M + 26) + 2 = 81M  80
Bob:
1st 2nd 3rd
N  2N + 27  2(2N + 27) + 27 = 4N + 81  2(4N + 81) + 27 = 8N + 189
 2(8N + 189) + 27 = 16N + 405
 81M + 80 = 16N + 405 ; M, N  Z+
 81M – 16N = 325
16N  325 16N  1
M= = 4
81 81
 N |min  5  M = 5
M  N|min  10
Call us: +91-744-2665544
5. Let m be the smallest positive integer such that m2 + (m + 1)2 +.....+ (m + 10)2 is the square of a
positive integer n. Find m + n.
Ans. 95
Sol. n2 = m2 + (m + 1)2 + (m + 2)2 +..........+ (m + 10)2
10 11 21
n2 = 11 m2 + 2m·55 +
6
n2 = 11 (m2 + 10m + 35) = 11((m + 5)2 + 10)
(m + 5)2 + 10 = 11 ;  should be perfect square
 = 1, 4, 9, 16, 25, 36 are not possible
 = 49 is possible
So, (m + 5)2 = 529  m + 5 =  23
m  18
 n2 = 11(539)  n  77
m  n  95
6. Let a,b be positive integers satisfying a3 –b3 –ab = 25. Find the largest possible value of a2 + b3.
Ans. 43
Sol. a, b  Z
a3 = b3 + ab + 25  a3 > 27  a > 3
a3 – b3 – ab = 25
 
  a  b  a 2  b2  ab  ab  25
 a 2  b2  ab  ab  25.......  a  b  1
 a |max  4 & a > 3
 a  4  b3 + 4b – 39 = 0
 (b–3) (b2 + 3b + 13) = 0
 b3
 a2 + b3 = 16 + 27 = 43
Call us: +91-744-2665544
7. Find the number of ordered pairs (a,b) such that a,b  {10, 11, … 29, 30} and
GCD(a,b) + LCM(a,b) = a + b.
Ans. 35
Sol. Let GCD (a, b) = x, LCM (a, b) = y
x+y=a+b and xy = ab
Quadratic equation having roots x, y is given by
x
t2 – (a + b) t + ab = 0
y
Taking x = a, y = b
If GCD = a, LCM = b
 b = a;   {1, 2, 3, .....}
Taking  = 1,  a = b
(a, b) (10, 10) (11, 11) ........., (30, 30)  21 pairs
Taking  = 2, 3, .........
(a, b) (10, 20), (10, 30), (11, 22), (12, 24), (13, 26), (14, 28), (15, 30), (20, 10), (30, 10),
(22, 11), (24, 12), (26, 13), (28, 14), (30, 15) = 14 pairs.
 Total 35 pairs.
q m
8. Suppose the prime numbers p and q satisfy q2 + 3p = 197p2 + q. Write as  + , where
p n
,m,n are positive integers, m < n and GCD(m,n) = 1. Find the maximum value of  + m + n.
Ans. 32
Sol. p, q are Prime number
q2 + 3p = 197 p2 + q
 q(q1) = 197 p2  3p = p (197p3)
 q –1= p  q = p+1
(p+1) p = p (197p–3)
 2p+ = 197p–3
3
P is prime
197   2
max  14    14  p  17
q = 14 × 17 +1
q 1
 14    m  n  14  1  17  32
p 17
Call us: +91-744-2665544
9. Two sides of an integer sided triangle have lengths 18 and x. If there are exactly 35 possible
integer values y such that 18, x, y are the sides of a non – degenerate triangle, find the number of
possible integer values x can have.
Ans. Bonus
Sol. Bonus (Infinite value of side x are possible.)
10. Consider the 10 digit number M = 9876543210. We obtain a new 10 digit number from M
according to the following rule: we can choose one or more disjoint pairs of adjacent digits in
M and interchange the digits in these chosen pairs, keeping the remaining digits in their own
places. For example, from M = 9876543210, by interchanging the 2 underlined pairs, and
keeping the others in their places, we get M1 = 9786453210 . Note that any number of (disjoint)
pairs can be interchanged. Find the number of new numbers that can be so obtained from M.
Ans. 88
Sol. M = 9876543210
Case (i) only one pair is interchanged = 9
Case (ii) two disjoint pairs are interchanged
x1 x2 x3
O O
x1 + x2 + x3 = 8, where x1  0,x2  1,x3  1
6 31
C31 8 C2  28
Case (iii) when 3 pairs are interchanged
4  4 1
C41 7 C3  35
Case (iv) when 4 pairs are interchanged
2 51
C51 6 C4  15
Case (v) when 5 pairs are interchanged = 1
Total = 9 + 28 + 35 + 15 + 1 = 88
11. Let AB be a diameter of a circle  and let C be a point on , different from A and B. The
perpendicular from C intersects AB at D and  at E ( C). The circle with centre at C and radius
CD intersects  at P and Q. If the perimeter of the triangle PEQ is 24, find the length of the side
PQ.
Ans. 08
Sol. Let r be the radius of circle with center C
C
P
Q
A B
D
Call us: +91-744-2665544
So CP = CQ = CD = r
CPEQ is cyclic Quadrilateral
Apply Ptolemy thm
CP × EQ + CQ × PE = PQ × CE
r × EQ + r × PE = PQ (2r) { CD = DE = r}
 EQ + PE = 2PQ ….(i)
Given , Perimeter of PEQ = 24
PE + EQ + PQ = 24
From equation (i)
2PQ + PQ = 24
3PQ = 24
PQ  08
12. Given ABC with B = 60° and C = 30°, let P,Q, R be point on sides BA, AC, CB respectively
such that BPQR is and isosceles trapezium with PQ  BR and BP = QR. Find the maximum
2  ABC 
possible value of where [S] denotes the area of any polygon S.
 BPQR 
Ans. Bonus
Sol.
13. Let ABC be a tringle and Let D be point on the segment BC such that AD = BC. Suppose
CAD = x°, ABC = y° and ACB = z° and x, y, z are in an arithmetic progression in that order
where the first term and the common difference are positive integers. Find the largest possible
value ABC in degrees.
Ans. 59
Sol.
14. Let x, y, z be complex numbers such that
x y z
  9
yz zx xy
x2 y2 z2
   64
yz zx xy
x3 y3 z3
   488
yz zx xy
x y z m
If    where m, n are positive integers with GCD (m, n) = 1, find m + n.
yz zx xy n
Ans. 16
Call us: +91-744-2665544
x y z
Sol.   9 ...(i)
yz zx xy
Multiply both sides by (x + y + z)
x2 y2 z2
   x  y  z  9(x  y  z)
yz zx xy
 8(x + y + z) = 64
 x+y+z=8 ...(a)
x2 y2 z2
Now,    64 ...(ii)
yz zx xy
Multiply both sides by (x + y + z)
x3 y3 z3
   x 2  y 2  z 2  64(x  y  z)
yz zx xy
 488 + 82 – 2(xy + yz + zx) = 512
 xy + yz + zx = 20 ...(b)
From equation (i)
x y z
  9
8x 8y 8z
8 8 8
 3    9
8x 8y 8z
 3  64  16(x  y  z)  xy  yz  zx 
 8   12
 (8  x)(8  y)(8  z) 
84
 8·  12
512  64(x  y  z)  8(xy  yz  zx)  xyz
56
 1
160  xyz
 xyz = 104 ...(c)
x y z x2  y2  z2
Now,   
yz zx xy xyz
64  40 24 3 m
   
104 104 13 n
 m + n = 16
Call us: +91-744-2665544
15. Let x, y be real numbers such that xy = 1. Let T and t be the largest and the smallest values of the
 x  y 2   x  y   2
expression .
 x  y 2   x  y   2
m
If T + t can be expressed in the form where m, n are nonzero integers with GCD (m,n) = 1,
n
find the value of m + n.
Ans. 25
Sol. xy = 1
1
xy  x  u (let), where u can be any real number and (x+y)2 = (x –y)2 + 4xy = u2 + 4
x
 x  y 2   x  y   2  u 2  u  2
Now = s (let)
 x  y 2   x  y   2 u 2  u  2
 (s–1)u2 + (s+1)u + 2(s–1) = 0
for real u, (s+1)2 – 8(s–1)2  0
   
2
 2 2  s  1  s  1)2  0
  2 2  1 s   2 2  1 2  
2 1 s  2 2 1  0 
 2 2 1 2 2 1
s  , 
 2 2 1 2 2 1
18
t+T=
7
 m + n = 25
16. Let a, b, c be reals satisfying
3ab + 2 = 6b, 3bc + 2 = 5c, 3ca + 2 = 4a.
Let Q denote the set of all rational numbers. Given that the product abc can take two values
r t
 Q and  Q , in lowest form, find r + s + t + u.
s u
Ans. 18
Sol. 3ab+2=6b ; 3bc +2=5c ; 3ca+ 2 = 4a
2 2 2
 3a   6 ; 3b   5 & 3c   4
b c a
By adding and multiplying above equations
1 1 1
3 (a+b+c)+ 2     = 15 .....(1)
a b c
Call us: +91-744-2665544
8 1 1 1
and 27 abc + +18 (a+b+c) +12  a  b  c  =120
abc  
8
 27 abc + + 6 ×15 = 120
abc
 27 (abc)2 –30 abc + 8 = 0
 27 (abc)2 – 18 abc –12 abc + 8 = 0
2 4 r t
 abc = . = .
3 9 s u
r + s + t + u =
17. For a positive integer n > 1, let g(n), denote the largest positive proper divisor of n and
f(n) = n – g(n). For example g(10) = 5, f(10) = 5 and g(13) = 1, f(13) = 12. Let N be the smallest
positive integer such that f(f(f(N))) = 97. Find the largest integer not exceeding N.
Ans. 24
Sol.  
f f  f  N    97
 
 f  f  N    g f  f  N    97
Taking f(f(N)) = t
 t – g (t) = 97; here g(t) divides t
 g(t) = 97  t = 194
f(f(N)) = 194
 f(N) – g(f(N)) = 194
Taking f(N) = u
 u – g (u) = 194; here g(u) divides u
 g(u) = 97, u = 291
Now, f(N) = 291
 N – g(N) = 291; g(N) divides 291
 N = 582
 Smallest value of N is 582
So  N   24
18. Let m, n be natural numbers such that

m +3n – 5 = 2LCM(m, n) – 11 GCD(m, n).
Find the maximum possible value of m + n.
Ans. 70
Call us: +91-744-2665544
Sol. m = pa
n = pb
 LCM = pab & GCD = p ; GCD (a,b)=1
m + 3n–5 = 2 LCM (m,n) – 11 GCD (m,n)
pa + 3pb – 5 = 2pab –11p
 11p–5 = 2pab – pa–3pb = p (2ab –a–3b)
 22p–10+3p = p(4ab –2a –6b+3)
 25p –10 =p (2a–3) (2b–1)
Now p/10  p = 1,2,5,10
p =1  15 = (2a – 3) (2b –1)
a=4, b = 2(reject)
a=2, b = 8(reject)
p=1 15 = (2a –3) (2b –1)
p = 2  20 = (2a –3) (2b – 1)  Not possible

p = 10  Not possible
p = 5  23 = (2a– 3) (2b –1)  a = 13 & b =1
 m = 65 & n = 5  (m  n)max  70
19. Consider a string of n 1's. We wish to place some + signs in between so that the sum is 1000. For
instance, if n = 190, one may put + signs so as to get 11 ninety times and 1 ten times, and get the
sum 1000. If a is the number of positive integers n for which it is possible to place + signs so as to
get the sum 1000, then find the sum of the digits of a.
Ans. 10
Sol. 111a + 11b + c = 1000 ; (a, b, c  W)
a = 0  11b + c = 1000
0 1000
1 989 = 1000 – 11
2 978 = 1000 – 22 91 possibility
90 10 = 1000 – 990
a = 1  11b + c = 889
0 889
1 889 – 11
2 889 – 22 81 possibility
80 889 – 880
Call us: +91-744-2665544
a = 2  71 possibility
a = 9  1 possibility
 Required = 1 + 11 + 21 + .......91 = 460
sum of the digits = 10
20. For an integer n  3 and a permutation  = (p1, p2, ..., pn) of {1, 2, ..., n}, we say p is a landmark
point if 2   n – 1 and  p –1 p   p 1  p  > 0. For example, for n = 7, the permutation
(2, 7, 6, 4, 5, 1, 3) has four landmark points: p2 = 7, p4 = 4, p5 = 5 and p6 = 1. For a given n  3, let
L(n) denote the number of permutations of {1, 2, ...., n} with exactly one landmark point. Find the
maximum n  3 for which L(n) is a perfect square.
Ans. 3
Sol.
21. An ant is at a vertex of a cube. Every 10 minutes it moves to an adjacent vertex along an edge. If
N is the number of one hour journeys that end at the starting vertex, find the sum of the squares of
the digits of N.
Ans. 74
Sol. Case I : If ant is moving along 1 axis
3
C1 = 3 ways
Case II : If ant is moving along 2 axes y
6!
3C2   45 ways x
2!.4!
z
Case III : If ant is moving along all three axes
6!
 90 ways
2!.2!.2!
 Total number of ways = 138 i.e. N = 138
 the sum of the squares of the digits of N = 74
22. A binary sequence is a sequence in which each term is equal to 0 or 1. A binary sequence is called
friendly if each term is adjacent to at least one term that is equal to 1. For example, the sequence
0, 1, 1, 0, 0, 1, 1, 1 is friendly. Let Fn denote the number of friendly binary sequences with n
terms. Find the smallest positive integer n 2 such that Fn > 100.
Ans. 08
Sol. ---------------------1  Fn–1
---------------------1 0 0  Fn–3
---------------------1 0  Fn–2
Fn = Fn–1 + Fn–2 + Fn–3:
 F1 = 1 {1]
F2 = 3 {1, 01, 10}
F3 = 5 {111, 101, 010, 011, 110}
 1, 3, 5, 17, 31, 57, 105
 F8 > 100  n  8
Call us: +91-744-2665544
23. In a triangle ABC, the median AD divides BAC in the ratio 1 : 2. Extend AD to E such that EB
is perpendicular to AB. Given that BE = 3, BA = 4, find the integer nearest to BC2.
Ans. 29
AE = 5
3 4
sin   ,cos  
5 5
A
using m – n cot rule
2 cot = cot – cot2  
4 7
 2 cot = 
3 24 4 y
25
 cot  = 
48 t t
B C
Now, In ABD D
4 t

sin  sin  5-y
3
4 sin  2929
 t 
sin  20
2929 E
BC2  4t 2   29.29
100
2
So, [BC ] = 29
24. Let N be the number of ways of distributing 52 identical balls into 4 distinguishable boxes such
that no box is empty and the difference between the number of balls in any two of the boxes is not
a multiple of 6. If N = 100a + b, where a, b are positive integers less than 100, find a + b.
Ans. 81
Sol. a1 + a2 + a3 + a4 = 48
 6p1  r1    6p2  r2    6p3  r3    6p4  r4   48
 6  p1  p2  p3  p4    r1  r2  r3  r4   48 ; 0  ri ;  5
Case I : r1 + r2 + r3 + r4 = 6 ; p1 + p2 + p3 + p4 = 7
0 1 2 3  10C3
 10C3 . 4! = 2880 ways
Case II : r1 + r2 + r3 + r4 = 12 ; p1 + p2 + p3 + p4 = 6
0 3 4 5  9 C3
1 2 4 5
 9C3 × 2 × 4! = 4032
Call us: +91-744-2665544
Case III : r1 + r2 + r3 + r4 = 18; p1 + p2 + p3 + p4 = 5
not possible
So, total number of ways = 2880 + 4032 = 6912 ways
i.e. N = 6912 = 100 × 69 + 2 = 100 a + b
 a = 69, b = 12
 a + b = 81
Call us: +91-744-2665544

IOQM 2022 Solution

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

IOQM 2022 Solution

Uploaded by

Copyright:

Available Formats

Time : 3 Hours Number of Question : 24 Max.

positive integer n. Find m + n.

Sol. n2 = m2 + (m + 1)2 + (m + 2)2 +..........+ (m + 10)2

(m + 5)2 + 10 = 11 ;  should be perfect square

 = 1, 4, 9, 16, 25, 36 are not possible

So, (m + 5)2 = 529  m + 5 =  23

 a |max  4 & a > 3

 (b–3) (b2 + 3b + 13) = 0

Multiply both sides by (x + y + z)

Multiply both sides by (x + y + z)

 488 + 82 – 2(xy + yz + zx) = 512

 xyz = 104 ...(c)

18. Let m, n be natural numbers such that

p = 2  20 = (2a –3) (2b – 1)  Not possible

 10C3 . 4! = 2880 ways

So, total number of ways = 2880 + 4032 = 6912 ways

i.e. N = 6912 = 100 × 69 + 2 = 100 a + b

You might also like