0% found this document useful (0 votes)
389 views6 pages

Question and Solution of RMO (2023)

The document provides instructions for the Regional Mathematical Olympiad exam. It states that there are 6 questions, the maximum marks are 102, calculators are not allowed, and each question is of equal value. It instructs candidates to answer each question on a new page and clearly indicate the question number. It provides an example of how the solutions should be formatted.

Uploaded by

Fire Blaze Plays
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
389 views6 pages

Question and Solution of RMO (2023)

The document provides instructions for the Regional Mathematical Olympiad exam. It states that there are 6 questions, the maximum marks are 102, calculators are not allowed, and each question is of equal value. It instructs candidates to answer each question on a new page and clearly indicate the question number. It provides an example of how the solutions should be formatted.

Uploaded by

Fire Blaze Plays
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Date: 29/10/2023 Max. Mark.

102

Number of Questions: 6

Corporate Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 | Ph.: 011-47623456

SOLUTIONS
for
Regional Mathematical Olympiad (2023)
INSTRUCTIONS TO CANDIDATES
1. Calculators (in any form) and protractors are not allowed.
2. Rulers and compasses are allowed.
3. All questions carry equal marks. Maximum marks: 102.
4. No marks will be awarded for stating an answer without justification.
5. Answer all the questions.
6. Answer to each question should start on a new page. Clearly, indicate the question number.

-1-
RMO-2023

RMO
1. Let N be the set of all positive integers and S = {(a, b, c, d)  N4 : a2 + b2 + c2 = d2}. Find the largest positive
integer m such that m divides abcd for all (a, b, c, d)  S.
Sol. a2 + b2 + c2 = d2
Let a, b, c are odd  d is odd
a2, b2, c2 → 4k + 1
a2 + b2 + c2 → 4k + 3
But d2 can’t be of form 4k + 3
Let any one is even without loss of generality lets assume a is even
a2 + b2 + c2 → even  d is even
 abcd is divisible by 4.
Let any two numbers be even
 abcd is divisible by 4
 abcd must be divisible by 4
Now, let a, b, c  {3k + 1, 3k + 2}
a2, b2, c2  {3k + 1}
a2 + b2 + c2  3m
 abcd is divisible by 3
 Largest positive integer = 12
For example (a, b, c, d) = (1, 2, 2, 3), (2, 3, 6, 7), …
But all should be divided by 12, then largest positive integer is 12.
2. Let  be a semicircle with AB as the bounding diameter and let CD be a variable chord of the semicircle of
constant length such that C, D lie in the interior of the arc AB. Let E be a point on the diameter AB such that CE
and DE are equally inclined to the line AB. Prove that
(a) The measure of CED is a constant
(b) The circumcircle of triangle CED passes through a fixed point.
Sol. Let CEA = DEB =  (given)
 CED = 180° – 2
Extend CE so that it meets the circle at point C
 MEC = 

-2-
RMO-2023

Therefore, C and C are mirror image of each other


 EMC = 90°
 MCE = 90° – 
Let O be the center of the circle, the angle made by chord CD at the centre is 2(90° – ) = 180° – 2
CED = COD = 180° – 2
Therefore CEOD are concyclic
Now in COD
OD = OC = r
CD = 2rsin(90° – )
l
sin ( 90 −  ) =
2r
 90° –  is constant as l and r both are constant
  is constant, CED = 180° – 2 is also constant
Now as we know that CEOD are concyclic. The circumcircle of CED will always pass through point O which is
a fixed point.
3. For any natural number n, expressed in base 10, let s(n) denote the sum of all its digits. Find all natural numbers
m and n such that m < n and (s(n))2 = m and (s(m))2 = n.
Sol. (s(n))2 = m and (s(m))2 = n
m<n
 m and n are perfect square
Claim
“n and m cannot be more than 3 digit number”
If n is 4 digit number
(s(n))max = 36
mmax = 1296
 m  1296
(s(m))max = 19 when m = 676
 n  361
But this contradicts the fact that n is 4 digit number
Now lets consider n to be a 3 digit number
(s(n))max = 19 when m = 676
 m  361
Now checking
10 11 12 13 14 15 16 17 18 19
m 100 121 144 169 196 225 256 289 324 361
n = (s ( m ))
2
1 4 81 256 256 81 169 361 81 100

(s ( n ))
2
1 16 81 169 169 81 256 100 81 1

But m < n
 m = 169, n = 256
Therefore, only possible pair is (169, 256)  (m, n)

-3-
RMO-2023

4. Let 1, 2 be two intersecting circles with centres O1, O2 respectively. Let l be a line that intersects 1 at points
A, C and 2 at points B, D such that A, B, C, D are collinear in that order. Let the perpendicular bisector of
segment AB intersect 1 at points P, Q; and the perpendicular bisector of segment CD intersect 2 at points R,
S such that P, R are on the same side l. Prove that the midpoints of PR, QS and O1O2 are collinear.
Sol. Let the midpoint of PR, QS and O1O2 be X, Y and Z respectively foot of perpendiculars from points O1 and O2
onto the line ABCD be k1 and k2 respectively. Now the line PQ and RS will be parallel as both are perpendicular
to the line AD, therefore PQRS is a trapezium let L and M be the intersections of PQ and RS with AD. As X and
Y are midpoints, so XY will bisect LM by equal intercept theorem.

Now O1k1k2O2 will be a trapezium and let line XY meets k1k2 at N and O1O2 at Z.
To prove
k1N = Nk2
LN – k1L = MN – k2M (as N is the mid-point of LM)
k1L = k2M
Let AB = 2, BC = 2, CD = 2
AB
AL = =
2
AC
Ak1 = = +
2
k1L = Ak1 – AL = 
CD
DM = =
2
DB
Dk2 = =  +
2
k2M = Dk2 – DM = 
k1L = k2M =  (hence proved)
As N is the mid-point of k1k2, therefore Z will be mid-point of O1O2 by equal intercept theorem. So the points X,
Y and Z will be collinear.
5. Let n > k > 1 be positive integers. Determine all positive real numbers a1, a2, …, an which satisfy
n
kaik n

 ( k − 1) a
i =1
k
+1
=  ai = n
i =1
i

Sol. n > k > 1 and n, k  I+ and ai  positive real numbers


n
kaik n

 ( k − 1) a
i =1
k
+1
=  ai = n
i =1
i

By AM-GM inequality

-4-
RMO-2023

aik + aik + aik + ... + aik + 1


1
k −1
  aik .aik ...aik .1 k
k  
 k −1 

( k − 1) aik + 1  k ( ai )
k −1

Now
n
kaik n
kaik
 ( k − 1) a
i =1
k
+1
 
i =1 kaik −1
i
n
 
i =1
ai

n n
 n =  ai   ai
i =1 i =1

Now applying AM  RMS


n n

 ai a i
i =1
 i =1
=1
n n
n
 i =1
ai  n

n
kaik
  ( k − 1) a
i =1
k
+1
n
i

n
kaik
But given that 
i =1 ( k − 1) aik + 1
=n

From inequality we will get

 ai = 1

6. Consider a set of 16 points arranged in a 4 × 4 square grid formation. Prove that if any 7 of these points are
coloured blue, then there exists an isosceles right-angled triangle whose vertices are all blue.

Sol. Consider 4 × 4 grid with unit distance then


Case-I: Only 2 rows are used
All 7 points are in any two rows, then it is easy to find an isosceles right angled triangle as shown, in figure 6.1.
Here A1C1A3 is such triangle. A1A3C3 is another such pairs of point to form isosceles right angled triangle with

dimension 2, 2, 2 2 ( )

-5-
RMO-2023

Case-II: All four rows are used


By Pigeonhole principle; at least three rows contain 2 points and 7th point can be in the remaining row.
Let’s take a symmetric case; figure 6.2
(
Now, take point at D4 then A1A4D4 makes the required triangle with dimension 4, 4, 4 2 . )
Similarly For D3 → B3C4D3 will form such triangle with dimension ( 2, 2, 2 )
For D2 → B2C1D2 forms required triangle with dimension ( 2, 2, 2)
For D1 → D1A1A4 forms required triangle with dimension ( 4, 4, 4 2 )

Let’s take an asymmetric case of distribution of points as shown in figure 6.3


(
For point at D1, D1A1A4 forms isosceles right angled triangle with dimension 4, 4, 4 2 )
For D2 → D2C1B2 forms required triangle ( 2, 2, 2 )
For D3 → D3B2A4 forms required triangle with dimension ( 5, 5, 10 )
For D4 → D4A4A1 forms required triangle with dimension ( 4, 4, 4 2 )

Or easily A1B1B2 forms such right angled isosceles triangle.

Case-III:
When only three rows are used
 Again by Piegonhole principle each row will contain at least two points
 Lets consider such colouring
For D3 → D3D1B1 forms such triangle.
For D4 → D2D4B4 forms such required triangle.
Hence, an isosceles right angled triangle must exist in each case.

❑ ❑ ❑
-6-

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy