IOQM_EXAMINATION 2023

Number of Questions: 30 Time: 3 Hours

Max Marks: 100
INSTRUCTIONS
1. Use of mobile phones, smartphones, iPads, calculators, programmable wrist watches is STRICTLY
PROHIBITED. Only ordinary pens and pencils are 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. The name, email address, and date of birth entered on the OMR sheet will be your login credentials for
accessing your score.
4. Incompletely, incorrectly or carelessly filled information may disqualify your candidature.
5. 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.
6. The answer you write on OMR sheet is irrelevant. The darkened bubble will be considered as your final
answer.
7. Questions 1 to 10 carry 2 marks each: questions 11 to 20 carry 3 marks each: questions 21 and 30
carry 5 marks each.
8. All questions are compulsory.
9. There are no negative marks.
10. 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.
11. After the exam, you may take away the Candidate's copy of the OMR sheet.
12. Preserve your copy of OMR sheet till the end of current olympiad season. You will need it later for
verification purposes.
13. You may take away the question paper after the examination.

1
 QUESTION & SOLUTIONS
1. Let n be a positive integer such that 1  n  1000. Let M n be the number of integers in the set

Xn   
4n  1, 4n  2,......, 4n  1000 . Let

a  max M n :1  n  1000 , and b  min M n :1  n  1000 .

Find a – b.

Sol.. Xn   4n  1, 4n  2,.... 4n  1000 

M n  # Perfect squares m 2 s.t 4n  1  m2  4n  1000

n range Mn

1 5  m 2  1004 31  2  29
2 9  m 2  1008 31  2  29
3 13  m 2  1012 31  3  28
6 25  m 2  1024 31  4  1  28
1000 632  4001  m2  5000  712 70  63  7

Mn Mn  7 a  min  M n   max  M n   29

 a  b  22
2. Find the number of elements in the set

 a, b   N : 2  a, b  2023, log  b   6log  a   5

a b

6
Sol.. x  log ba  x  5
x

x2  5 x  6  0
x  3, 2

 b  a3 or  b  a 2

2025  452

 a, 6    2, 2 2  ,.....  44, 442   43

or  2, 23  . . . . . . . . 12,123   11

43  11  54
3. Let  and  be positive integers such that

16  7
  .
37  16

Find the smallest possible value of  .

16  7
Sol.  
37  16

37  16 15   z 2
    
16  7 16  7

16  7
   where a    2
4  2

16  7 a
   5 2 Where b    3a
4  2 b

  b  3a
  a  2  7a  2b
Now for smallest  smallest a, b are needed

a  3, b  1

   23
4. Let x, y be positive integers such that

x 4   x  1  y 3  23   1.

Find the maximum possible value of x + y.

Sol.  4  1   x  1  y 3  23 

x 1 | x4 1

But  x 1 | x4 1

 x 1 | 2  x  2 or 3

1) x  2 1  y 3  23  y 3  40 x

2) x  3 82  2  y 3  23   y 3  41  23  64

 xy  34 7.

3
5. In a triangle ABC, let E be the midpoint of AC and F be the midpoint of AB. The medians BE
and CF intersect at G. Let Y and Z be the midpoints of BE and CF respectively. If the area of
triangle ABC is 480, find the area of triangle GYZ.
Sol.

BE 2BE GX GB  BY 2 1 1
BY  BG      
2 3 BE BE 3 2 6

YG 1 / 6 1
  
BG 2 / 3 4

1 ZG 1
parallelly GZ  CF and  in GBC and GYZ
6 CG 4

YG ZG 1
BGC  YGZ and BG  CG  4 by SAS similarly BGC  YGZ

1 1
ar  BGC   ar  ABC    480  160
3 3
(due to property of medians)
2
1 160
 ar  YGZ   ar  BGC     (  s are similar)   10
4 16
6. Let X be the set of all even positive integers n such that the measure of the angle of some
regular polygon is n degrees. Find the number of elements in X.

Sol. Angle sum property in polygon is  m  z  180 where m is the number of sides

 m  2 180
Angle in regular polygon are all equal thus angle  Am 
m

Claim for Am to be even m must be a factor of 180

180
When m is a factor of 180, is an integer and  m  2  will be either co-prime to m
m
(if m is odd or will have gcd of 2 with m)
 180  22  32  5

180
if m  360 then  360  2   179 (not even)
360
Thus number of elements in X is 3  3  2  18
7. Unconventional dice are to be designed such that the six faces are marked with numbers from
1 to 6 with 1 and 2 appearing on opposite faces. Further, each face is colored either red or
yellow with opposite faces always of the same color. Two dice are considered to have the same
design if one of them can be rotated to obtain a dice that has the same numbers and colors on
the corresponding faces as the other one. Find the number of distinct dice that can be designed.
Sol. 1  2 given
Possible ways to arrange 3,4,5,6 in the net below is

Where X, Y, Z, W are 3,4,5,6 in some permutation

This is small as finding no of ways to make 4 people sit in a circular round table
(Extra constraint that 180 symmetry need not be imposed)
4
C2
Thus  6 ways
4
Now colowing of the dice is independent to the numbering and 3 pairs of opposite faces ezxist
thus this can be done in 23  8 ways
Total 6  8  48 different dice exist.
8. Given a 2 × 2 tile and seven dominoes (2 × 1 tile), find the number of ways of tiling (that is,
cover without leaving gaps and without overlapping of any two tiles) a 2 × 7 rectangle using
some of these tiles.

Sol. Case 1: 2 × 2 block excluded

If we place a 2 × 1 block vertically then we are left with enough space to fill the remaining.

a × 2 and b × 2 regions where a + b = 6 and a, b,  0,1,2,....,6 .

for an n × 2 board let this number be E n

E1  1 E2  2

Note: En  En1  En 2

5
 Proof: Take the frist 2 × 1 block and place it vertically on the first 2 squares of the board we are left
with a (n – 2) × 2 board and ways to file if are E n1 .
Now place the first 2 × 1 block horizontally in the top right 2 squares the space directly below it must
be alos filled with a 2 × 1 horizontal this can be filed in E n2 ways.
Thus
n En
1 1
2 2
3 3
4 5
5 8
6 13
7 21

 E7  21
Now case 2: 2 × 2 tileis included in the filling let the number of way sto file the n × 2 board with one
2 × tile and rest 2 × 1 In.

I1  0 I2  1

Now if we place the firs 2×1 block vertically the remaining (n – 1) × 2 will be filed in In 1 ways.

If the first 2 × 1 block is placed horizotnally then no. of ways to tile the remaining become In 2 .

If the fist block is a 2 × 2 block then the reamining board can be filed in E n2 ways.

Thus In  In1  In2  En 2

n En In
1 1 0
2 2 1
3 3 2
4 5 5
5 8 10
6 13 20
7 21 38

Thus total no.of ways will be I7  E7  59.

9. Find the number of triples (a, b, c) of positive integers such that
(a) ab is a prime
(b) bc is a product of two primes
(c) abc is not divisible by square of any prime and

(d) abc  30.

Sol. Case I : a  1, b  p1 , C  p2  p1

Where p1 , p2  {2,3,5, 7,11,13}

such that p1 p 2  30

p1 p2  2  3, 2  5, 2  7, 2  11, 2  13,3  15,3  7

So, No of triples  a, b, c   14

Case - II : a  p, b  1 c  p2 p3  None is p1

Also, p1 p2 p3  30  p1 p2 p3  2  3  5

No. of triples  a, b, c   3

(cases are  2,1,15 ,  3,1,10  5,1, 6 )

Final (Total) no. of triples = 17.

10. The sequence an n0 is defined by a0  1, a1  4 and an  2  4an 1  7an , for n  0 . Find the
2
number of positive integers divisors of a50  a49 a51.

Sol. Try this using the concept of number walls

1 1 1 1 1
a0 a1 a2 a3 a4 ......
b0 b1 b2 b3 b4 ......

here any 5 numbers in a

are related as a 2  xw  yz

7
 Thus b1  a12  a 2 a 0 and b n  a n2  a n 1a n 1

a 2  4   4   1  16  7  9

2
 b1   4   9  7

a 3  4  9     4   36  28  8

 b 2  81   8 4   49

If is an have a reacurrence relation of the form a n  a n 1   a n  2 then b n forms a G.P..

2
Thus a 50  a 49 a 51  b50  50

Divisors are 1, >, >2, . . .. , >50 thus answer is 51.

11. A positive integer m has the property that m 2 is expressible in the form 4n 2  5n  16 where n
is an integer (of any sign). Find the maximum possible value of m  n .

2
Sol. m 2  4n 2  5n  16  16m 2  8n  5   231

  4m  18n  5    4m  8n  5    231

  
[4k  1][4k ' 1] 3  7  11

Various possibilites

m n
3  77  10 4
7  33  5 1
11  21  4 0
231 1  29 15

m  n m ax
 14 .

12. Let P  x   x3  ax 2  bx  c be a polynomial where a, b, c are integers and c is odd. Let pi be

the value of P  x  at x = i. Given that p13  p23  p33  3 p1 p2 p3 , find the value of p2  2 p1  3 p0 .

Sol. p13  p32  p33  3p1p2p3

So, either p1  p2  p3  0 or p1  p2  p3

Now,  p1  p3   p2 = even + odd = odd  0

 So, p1  p2  p3  k (say)

So, p  x   k   x  1  x  2  x  3    x 

 p2  2p 1  3p0   p2  k   2  p1  k   3  p0  k 

 q 2  2q1  3q 0  0  0  18  18.

1
13. The ex-radii of a triangle are 10 ,12 and 14. If the sides of the triangle are the roots of the
2
cubic x 3  px 2  qx  r  0 , where p, q, r are integers, find the integer nearest to pqr .

 
Sol. r1r2    s  s  c
s  a s b

SO, r1  r2  r3   s  s  x   s  s  b   s  a

 s  a  21 13, s  b  6  49, s  x  7  45

Adding 2s 2  7   39  42  45  7 126  s  21, so a  13, b  14, c  15

Now 1  p  q  r   p  1   1  a  1  b  1  c 

  a  1 b  1 c  1  14 15 16  p  q  r  3359

The integer nearest to p  q  r  58

14. Let ABC be a triangle in the xy plane, where B is at the origin (0, 0). Let BC be produced to D
such that BC : CD = 1 : 1. CA be produced to E such that CA : AE = 1 : 2 and AB be produced
to F such that AB : BF = 1 : 3. Let G(32, 24) be the centroid of the triangle ABC and K be the
centroid of the triangle DEF. Find the length GK.
Sol.

9
 C  mid pt. of BD

M  mid pt. of FD

Clearly MC || FB  MC || BA
So, very clearly FB : BM  EA : AC  2 :1.

BK

 GK  GB  40  322  242  8  5  40
15. Let ABCD be a unit square. Suppose M and N are points on BC and CD respectively such
that the perimeter of triangle MCN is 2. Let O be the circumcentre of triangle MAN, and P be
2
 OP  m
the circumcentre of triangle MON. If    for some relatively prime positive integers
 OA  n
m and n, find the value of m + n.
Sol.

MN  2   x  y
Pythagas m   MNC
x 2  y 2  4  2  x  y   x 2  y 2  2 xy
xy  2 x  2 y  2  0
  x  y   xy  2   x  y 
t  1  x t   1  y

t  t 2   x  y
t      
1  t t 1  1  x 1  y 

2   x  y
1
x  y  xy

  
4
LET R  R  M A N 
 As MON is right is 
 MN  20 P  R 2
2 2 2
 OP   OP   1  1
      
 OA   R   2  2
mn  3
16. The six sides of a convex hexagon A1 A2 A3 A4 A5 A6 are coloured red. Each of the diagonals of
the hexagon is coloured either red or blue. If N is the number of colourings such that every
triangle Ai A j Ak , where 1  i  j  k  6 , has at least one red side, find the sum of the square of
the digits of N.

Sol. In ACE & BDF all sides are diagonals so at least one of these sides must be red.

AD, BE, CF many be red or B.

As any  formed by them coves atleast 1 edge of hexagon.

2
 No. of colouring   2  1  2  49  8  N  392 .
3 3

Sum of the sq. of = 9 + 81 + 4 = 94.

17. Consider the set

S   a, b, c, d , e  : 0  a  b  c  d  e  100

where a, b, c, d, e are integers. If D is the average value of the fourth element of such a tuple
in the set, taken over all the elements of S, find the largest integer less than or equal to D.

 99 
Sol. Total no taples   
5 
for do k + 1

k 
No. of ways is select a, b, c   
9 

k 
No. of ways to select e  98  k   k  1    98  k 
3 

11
 k 
 k  1   100   k  2 
3 

4  100  k  1  k   k  1 k  2  20  k  2  k  1 k  k  1  k  2
 
3!  9 3!  4  5

 k  1  k  2
 400    20  
4  5 

97 k  1 97 k  2
   
Sum of all valaco of of d  40  9
k 3 
  20  5 
 k 3  

 99  100 
 400    20  
5  6 

 99  100 
400    20  
Average  5  6 
 97 
5 
 

 100  200
 400  20    400   400  333.33  66.66..
 6  6

Ans: = 66.
18. Let P be a convex polygon with 50 vertices. A set F of diagonal of P is said to be minimally
friendly if any diagonal d  F intersects at most one other diagonal in F at a point interior to P..
Find the largest possible number of elements in a minimally friendly set F.

Sol. To place the 3rd diagonal ot coont intersect wither of the fdirst 2 diagonals

We have 3 different ways od adding the 3rd diagonal

 In case 1 and 2 we are left with smaller region than 3 to plane more diagonals thus the most compact
arrangement will give the largest minimal
Finally set

Thus || lineas they have 24 pairs of diagonals b/w them

Thus 24  2  25  2  71

19. For n  N , let P  n  denote the product of the digits in n and S  n  denote the sum of the
digits in n. Consider the set

A  n  N : P  n  is non-zero, square free and S  n  is a proper divisor of P  n  .

Find the maximum possible number of digits of the numbers in A.

Sol. As P(n) is square force

(1) Only repeated digit is 1

(2) Only digits allowed 1, 2, 3, 5, 6, 7.

(3) And if 6 apperas 2 or 3 anit appera

 C1 2& 3 are digits.

 Maixmum value of P(n) = 2 × 3 × 5 × 7 = 210

S  n   105

Manimum no of digits of n will be when

13
 n  2,3,5, 7,1,1,....,1
  (or its permutition)
88 times

So maximum number of digits = 92.

C 2 : Note if 6 is taken instead of 2 & 3

n  6,5, 7,1,1,....,1
 
87 times

No. of digits of n = 90
 Maximum possible no. of digits = 92.
20. For any finite non empty set X of integers, let max(X) denote the largest element of X and |X|
denote the number of elements in X. If N is the number of ordered pairs (A, B) of finite non-
empty sets of positive integers, such that
max(A) × |B| = 12; and |A| × max(B) = 11
and N can be written as 100a + b where a, b are positive integers less than 100, find a + b.

Sol. As |A| × amx {B} = 11

So either |A| = 11 B = {1} or max B = 11 A = {2}

C1] A  11B  1 or max {A} = 12

# such sets A  11.

C2] A = {a},  B  1, 2,3, 4, 6

B A no. of possible sets B

1 {11} {12} 1

2 {a1, 11} {6} a1  1, 2,....10  10

 10 
3 a1 , a 2 ,11 {4}  2   45
 

10 
4 a, a 2 a 311 {3}  8   120
 

 10 
6. a1 , a 2 ,....a 5 11 {2}  5   252
 
Total number of possible paris = 939
a +b = 43.
21. For n  N , consider non-negative integer-valued functions f on {1,2,...,n} satisfying f  i   f  j 
n n
for i  j and   i  f  i    2023. Choose n such that 
i 1 i 1
f  i  is the least. How many
such functions exist in that case?
n
n  n  1 n

Sol.  i  f  i   2023 
i r 2
  f  c   2023
i 1

 n  n  1  4046.

64.63  4032
n

for n  63  f  i   2023  2016  17

i 1

Consider a problem 1 + 1 + 2 + 3 it will correspond to functoin f(1) = f(2) = . . . . = f(2019) = 0.

f(2020) = f(2021) = 1 f(2022) = 2 & f(2023) = 3
So number of such fn is number of portions of 7.
7, 6 + 1, 5 + 2, 5 + 1 + 1, 4 + 3, 4 + 2 + 1,
4 + 1 + 1 + 1, 3 + 1 + 1, 3 + 2 + 2, 3 + 2 + 1
2 + 2 + 2 + 1, 2 + 2 + 1 + 1 + 1,
1 + 1 + 1 + 1 + 1 + 1 + 1.
So there are 15 functions.
22. In an equilateral triangle of side length 6, pegs are placed at the vertices and also evenly along
each side at a distance of 1 from each other. Four distinct pegs are chosen from the 15 interior
pegs on the sides (that is, the chosen ones are not vertices of the triangle) and each peg is
joined to the respective opposite vertex by a line segment. If N denotes the number of ways
we can choose the pegs such that the drawn line segments divide the interior of the triangle
into exactly nine regions, find the sum of the squares of the digits of N.
Sol.

The Chosen 4 Regs should be the medians from the vertices. i.e., AP8 , BP13 , CP3 .
Let they meet at G

15
 The 3 points chosen is 1 way.
The 4th reg should be any one of the remaining 12 regs.
Then nine regions will be formed 4th Reg chosen in 12 C1 ways

 N  1 12 C1  12
Let one reg chosen is the midpoint of AB. by converse of ceva’s th.
there are 4 possiblities to chose another two pegs on sides BC & AC.
i.e., P6 & P15 , P7 & P14 , P 9 & P12

P10 & P11 Total possiblities = 4 × 3 = 12

Remaining Reg will be chosen in 12C1 ways.
Total ways = 12 × 12 = 144 Here N = 12 + 144 = 156
Required answer  12  52  62  62.
23. In the coordinate plane, a point is called a lattice point if both of its coordinates are integers.
Let A be the point (12,84). Find the number of right angled triangles ABC in the coordinate
plane where B and C are lattice points, having a right angle at the vertex A and whose incenter
is at the origin (0,0).
Sol. Slopes of AB and AC are 3/4,-4/3 hence the points B and C are of the form “(12,84)-c(3/5,4/5)
(12,84)+b(4/5,-3/5) hence sides must be multiples of 5.

Now
(b-2r)(c-2r)=2r²
Gives (x-24)(y-24)=288 hence ans is number if divisors of 288 which is 18.
24. A trapezium in the plane is a quadrilateral in which a pair of opposite sides are parallel. A
trapezium is said to be non-degenerate if it has positive area. Find the number of mutually non-
congruent, non-degenerate trapeziums whose sides are four distinct integers from the set {5,
6, 7, 8, 9, 10).
Sol.

w<g d<b
2
d 2  b2   x  a  x   k 2

d 2  b2  c 2  a 2  2ac  d 2  x 2
2

x
 c  a   b2  d 2 0
2 c  a

x
 c  a   b2  d 2 0
c  d  c  a  0
2
so we get end  c  a   b 2  d 2  0
2
so we get  c  a   d 2  b 2  d  b  11

c  a  4
c a b d
9 5 6 7
9 5 7 8
10 5 6 7
10 5 8 9
10 6 7 8
only 6 is possible
25. Find the least positive integer n such that there are at least 1000 unordered pairs of diagonals
in a regular polygon with n vertices that intersect at a right angle in the interior of the polygon.
Sol. For diagonals to intersect at 90º the sum of ,  will be 90º.

17
     90 thus the arcs of length l1 and l2 must sum to be  radius at the center..
or the no. of sides of the polygon must be even.
is no.of sides of the regular polygon is n then consider a vertex A1.

for diagonal A1 A3 only possible pair will be A 2 A n  2 .

2

A1 A2
An
A3

A4

A1A n , A3A  n
for diagonal A1A 4 the other diagonal will be 
 2

 2
2  2 

A1A  n n 1
Thus A1A 5 diagonal will be part of 3 pairs unit 
 1 which will have pairs At this point we
2  2
have total.

Now diagonal A1A n 1 pair will be part of 1

A1A n  2  2 paris

 n  n
A1A  n    2   will be part of  2 pairs or A1A n  2 
 2  2 2 

Thus total no. of wnordered pairs will be

n  n  n 
1  2  3  ....    2     1    2   ...  .  2  1
2  2  2 
  n  n  n  n   n  n n 
  1   1  1   2   2  1   1   2 
2  2 2  2    2  2 2
 
2 2 2

n 
  1  n  2   n  1 2
2 
 
2 4

Thus we need to fidn smallest n such that 1000 

 n  2
4
2

1000  1024  32 2

 n  2  n  66 .
4
26. In the land of Binary, the unit of currency is called Ben and currency notes are available in
denominations 1, 2, 22, 23,... Bens. The rules of the Government of Binary stipulate that one
can not use more than two notes of any one denomination in any transaction. For example, one
can give a change for 2 Bens in two ways: 2 one Ben notes or 1 two Ben note. For 5 Ben one
can give 1 one Ben note and 1 four Ben note or 1 one Ben note and 2 two Ben notes. Using 5
one Ben notes or 3 one Ben notes and 1 two Ben notes for a 5 Ben transaction is prohibited.
Find the number of ways in which one can give change for 100 Bens, following the rules of the
Government.

100  64  32  4
Sol.  1100 100 2

4
4 can be given as 2  2
2 11

 64  32 3
2   64  16  16  3
64  32 as 2   64  16  8  8 3
2   64  16  8  4  4   2

These come from ways to split 64 | Thease come from ways to split 4
3  6  6  4  19
27. A quadruple (a, b, c, d) of distinct integers is said to be balanced if a + c = b + d. Let S be any
set of quadruples (a, b, c, d) where 1  a  b  d  c  20 and where the cardinality of S is 4411.
Find the least number of balanced quadruples in S.

19
  20  20  19  18 17
Sol. Total no of gutrapleo =   
  48  2

 5 19  3 17
=4845
Let a  c  b  d  k , 5  k  37
C 1] If k is odd

k j
No . of pair’s of integer with sum k will be and we need to select 2 pairs as
2
 a, c  &  b, d  .
k 1
If k  20 then the one pairs.
2

 k 1 
 
# tapleo =  2  .
 2 

41  k
If k  20. then pairs.
2

 41  k 
 
#tapleo =  2 
 2 
C2] Id k is even

k
No of pairs of district in kgms with sum k  1
2
If k  20

k 
  1
#Tapleo =  2 
2 

If k  20 then we get

 40  k 
 2 
 
 2 

Taking sum orer all volumes of 5  k  37

 #balanced taplo=525
#Nm balanced tupleo = 4845-525=4320
# least no of balanced tupleo in S= 4411-4320 =91
28. On each side of an equilateral triangle with side length n units, where n is an integer,
1  n  100. consider n – 1 points that divide the side into n equal segments. Through these
points, draw lines parallel to the sides of the triangle, obtaining a net of equilateral triangles of
side length one unit. On each of the vertices of these small triangles, place a coin head up. Two
coins are said to be adjacent if the distance between them is 1 unit. A move consists of flipping
over any three mutually adjacent coins. Find the number of values of n for which it is possible
to turn all coins tail up after a finite number of moves.
Sol. Claim : When n is of the form n  3m, m  Z
We can’t flip and for others it is possible thus ans = 100  33  67 .
29. A positive integer n< 1 is called beautiful if n can be written in one and only one way as
n  a1  a2  ...  ak  a1 .a2 ...ak for some positive integers a1 , a2 ,..., ak , where k > 1 and
a1  a2  ....  ak . (For example 6 is beautiful since 6 = 3 . 2 .1 = 3 + 2 +1, and this is unique. But
8 is not beautiful since 8 = 4 + 2 + 1 +1 = 4 . 2 . 1 . 1 as well as 8 = 2 + 2 + 2 + 1 + 1 = 2 . 2 . 2
. 1 . 1, so uniqueness is lost.) Find the largest beautiful number less than 100.
Sol. The required no.should have two prime factors other than 1 and itself.
95  5 19
so, 95 is the largest beautiful no  100
30. Let d(m) denote the number of positive integer divisors of a positive integer m. If r is the
n
number of integers n  2023 for which  i 1
d  i  is odd, find the sum of the digits of r..

Sol. Only perfect squares will have numbe rof perfet square divisors odd thu sthe sum  d  i  will be
i 1

odd when number of odd perfect squares before n is odd.

thus {1, 2, 3}  {9, 10, 11, . . . 15}  . . . .  {1849, 1850, . . . . 1935}
as 442  1936 and 452  2025

432  1849

Thus r  3  7  .... 1935  1848  3  7  ....  97

44  45
 1  2  3  4....43  44  2
 11 9 10  990  1

Sum of digits of r = 9 + 9 = 18.

21