RMO
RMO
Time : 3 Hours
Instructions :
• Calculators (in any form) and protractors are forbidden.
• Rulers and compasses are allowed.
• Answer all the questions. Maximum marks : 100
• Answer to each question should start on a new page. Clearly
indicate the question number.
4. Find the sum of all 3-digit natural numbers which contain at least
one odd digit and at least one even digit. [15]
6. In a book with page numbers from 1 to 100, some pages are torn off.
The sum of the numbers on the remaining pages is 4949. How many
pages are torn off ? [19]
2
REGIONAL MATHEMATICAL OLYMPIAD - 2009
2. We write a2 – 3a – 19 = a2 – 3a – 70 + 51 = (a – 10) (a + 7) + 51
Suppose 289 divides a2 – 3a – 19 for some integer a. Then 17 divides it
and hence 17 divides (a – 10) (a + 7). Since 17 is a prime, it must divide
(a – 10) or (a + 7). But (a + 7) – (a – 10) = 17. Hence whenever 17 divides
one of (a – 10) and (a + 7), it must divide the other also. Thus 172 = 289
divides (a – 10)(a + 7). It follows that 289 divides 51, which is impossible.
Thus, there is no integer a for which 289 divides a2 – 3a – 19.
4. Let X denote the set of all 3-digit natural numbers; let O be those
numbers in X having only odd digits; and E be those numbers in X
X
having only even digits. Then
O E is the set of all 3-digit natural
numbers having at least one odd digit and at least one even digit. The
desired sum is therefore x – y – z
x X y O zE
999 99
999 1000 99 100
x j – k = – = 50 × 9891 = 494550
x X j1 k 1 2 2
Consider the set O. Each number in O has its digits from the set
{1, 3, 5, 7, 9}. Suppose the digit in unit’s place is 1. we can fill the digit in
ten’s place in 5 ways and the digit in hundred’s place in
5 ways. Thus there are 25 numbers in the set O each of which has 1 in
its unit’s place. Similarly, there are 25 numbers whose digit in unit’s
place is 3 ; 25 having its digit in unit’s place as 5; 25 with
7 amd 25 with 9. Thus the sum of the digits in unit’s place of all the
numbers in O is 25(1 + 3 + 5 + 7 + 9) = 25 × 25 = 625
A similar argument shows that the sum of digits in ten’s place of all the
numbers in O is 625 and that in hundred’s place is also 625. Thus the
sum of all the numbers in O is
625(102 + 10 + 1) = 625 × 111 = 69375
Consider the set E. The digits of numbers in E are from the set
{0, 2, 4, 6, 8}, but the digit in hundred’s place is never 0. Suppose the
digit in unit’s place is 0. There are 4 × 5 = 20 such numbers. Similarly, 20
numbers each having digits 2, 4, 6, 8 in their unit’s place. Thus the sum
of the digits in unit’s place of all the numbers in E is
20(0 + 2 + 4 + 6 + 8) = 20 × 20 = 400
A similar reasoning shows that the sum of the digits in ten’s place of all
the numbers in E is 400, but the sum of the digits in hundred’s place of
all the numbers in E is 25 × 20 = 500. Thus the sum of all the numbers
in E is
500 × 102 + 400 × 10 + 400 = 54400
The required sum is
494550 – 69375 – 54400 = 370775
C Z1 D
(ii) Let X and Y be points in the interior . Join XY and produce them on
either side to meet the sides CD and EF of at Z1 and Z2 respectively..
We have
(XZ1 + YZ1) + (XZ2 + YZ2) = (XZ1 + XZ2) + (YZ1 + yZ2) = 2Z1Z2 2
by the first part. Therefore one of the sums XZ 1 + YZ 1 and
XZ2 + YZ2 is at most 1. We may choose Z accordingly as Z1 or Z2.
6. Suppose r pages of the book are torn off. Note that the page
numbers on both the sides of a page are of the form 2k – 1 and 2k, and
their sum is 4k –1. The sum of the numbers on the torn pages must be
of the from
4k1 – 1 + 4k2 – 1 + . . . + 4kr – 1 = 4(k1 + k2 + . . . + kr) – r
The sum of the numbers of all the pages in the untorn book is
1 + 2 + 3 + . . . + 100 = 5050
Hence the sum of the numbers on the torn pages is
5050 – 4949 = 101
We therefore have
4(k1 + k2 + . . . + kr) – r = 101
This shows that r 3 (mod 4). Thus r = 4 + 3 for some 0.
Suppose r 7, and suppose k1 < k2 < k3 < . . . < kr. Then we see that
4(k1 + k2 + . . . + kr) – r 4(k1 + k2 + . . . + k7) – 7
4(1 + 2 + . . . + 7) – 7
= 4 × 28 – 7 = 105 > 101
Hence r = 3. This leads to k1 + k2 + k3 = 26 and one can choose distinct
positive integers k1, k2, k3 in several ways.
5
Time : 3 Hours
Instructions :
• Calculators (in any form) and protractors are not allowed.
• Rulers and compasses are allowed.
• Answer all the questions. Maximum marks : 100
• Answer to each question should start on a new page. Clearly
indicate the question number.
1
de sin DOE
u 2 de
= 1 = .
x ab sin AOB ab
2
v fa w bc
Similarly, we obtain = , =
y cd z ef
Multiplying, these three equalities, we get uvw = xyz. Hence
x2y2z2 = u2v 2w2 = u2(zx) (xy).
This gives u2 = yz, as desired.
(A) Suppose a 4-digit number ends in 2. Then the second right digit
must be odd in order to be divisible by 4. Thus the last 2 digits must
be of the form 12, 32, 52,72 or 92. If a number ends in
12, 52 or 92, then the previous digit must be even in order not to be
divisible by 8 and we have 4 admissible even digits. Now the left
most digit of such a 4-digit number can be any non-zero digit and
there are 9 such ways, and we get 9 × 4 × 3 = 108 such number. If
a number ends in 32 or 72, then the previous digit must be odd in
order not to be divisible by 8 and we have 5 admissible odd digits.
Here again the left most digit of such a 4-digit number can be any
non-zero digit and there are 9 such ways, and we get 9 × 5 × 2 = 90
such number. Thus the number of 4-digit number having non-zero
digits, ending in 2, divisible by 4 not by 8 is 108 + 90 = 198.
(B) If the number ends in 4, then the previous digit must be even for
divisibility by 4. Thus the last two digits must be of the form
24, 44, 54, 84. If we take numbers ending with 24 and 64, then the
previous digit must be odd for non-divisibility by 8 and the left most
digit can be any non-zero digit. Here we get 9 × 5 × 2 = 90 such
numbers. If the last two digits are of the form 44 and 84, then previous
digit must be even for non-divisibility by 8. And the left most digit
can take 9 possible values. We thus get 9 × 4 × 2 = 72 numbers.
Thus the admissible numbers ending in 4 is 90 + 72 = 162.
(C) If a number ends with 6, then the last two digits must be of the form
16, 36, 56, 76, 96. For numbers ending with 16, 56, 76, the previous
digit must be odd. For numbers ending with 36, 76, the previous
digit must be even. Thus we get here (9 × 5 × 3) + (9 × 4 × 2)
= 135 + 72 = 207 numbers.
(D) If a number ends with 8, then the last two digits must be of the form
28, 48, 68, 88. For numbers ending with 28, 68, the
previous digit must be even. For numbers ending with 48, 88 the
previous digit must be odd. Thus we get (9 × 4 × 2) + (9 × 5 × 2)
= 72 + 90 = 162 numbers.
8
Thus the number of 4-digit numbers, having non-zero digits, and
divisible by 4 but not by 8 is 198 + 168 + 207 + 162 = 729.
1 1 3
Using a < b < c, we get 1 = <
a1 b1 c 1 a1
Thus a < 2. We conclude that a = 1. Putting this in the relation (1),
9
1 1 1 1
we get =1– = .
b 1 c 1 2 2
1 2
Hence b < c gives <
2 b 1
Thus b + 1 < 4 or b < 3. Since b > a = 1, we must have b = 2. This
1 1 1 1
gives = – = ,
c 1 2 3 6
or c = 5. Thus x : y : z = a + 1 : b + 1 : c + 1 = 2 : 3 : 6. Thus the
required numbers with the least sum are 2, 3, 6.
Alternative Solution : We first observe that (1, a, b) is not a
solution whenever 1 < a < b. Otherwise we should have
1 1 ab
= = for some integer . Hence we obtain =
a b 1 ab
showing that a|b and b|a. Thus a = b contradicting a b. Thus the
least number should be 2. It is easy to verify that (2, 3, 4,) and (2,
3, 5) are not solutions and (2, 3, 6) sati sf ies all the
conditions. (We may observe) (2, 4, 5) is also not a solution.) Since
3 + 4 + 5 = 12 > 11 = 2 + 3 + 6, it follows that (2, 3, 6) has the
required minimality.
5. Draw AL EF and extend it to meet AB in M. We show that
AL = LM. First we show that A, F, I, E are con-cyclic. We have
A
BIC = 90° + = 90° + 30° = 120°.
2
Hence FIE = BIC = 120°.
Since A = 60°,
it follows that A, F, , E are concyclic.
Hence BEF = IEF = IAF = A/2.
This gives
B A
AFE = ABE + BEF = .
2 2
Since ALF = 90°, we see that
B A C
FAM = 90° – AFE = 90° – – = = FCM.
2 2 2
This implies that F, M, C, A are concyclic. It follows that
C
FMA = FCA = = FAM.
2
Hence FMA is an isosceles triangle. But FL AM. Hence L is the
mid-point of AM or AL = LM.
10
Time : 3 hours
Instruction :
FD parallel to AC
FDK = DAC
ABE = CAD Hence proved.
20
4. Any side can be selected in C1 ways
Let x, y, z are gapes between two sides and
x 2 , y 2, z 2
also x + y + z = 17
Let x = t1 + 2 , y = t2 + 2, z = t3 + 2
B C A A
BIC= – 2 2 = = C1IB1 FAE = –
2 2 2 2
14
If AI is diameter of circle then this circle passes through F & E and
center of this circle is O
FOE = – A
Now In the FOE
FE2 = OF2 + OE2 – 2OF . OF cos( – A)
A 2 A 2 A 2
OF OE
A
= cos A
4 4 2 2
A 2
= (1 + cos A)
2
A A A
= AI2 cos2 = r2 cosec2 cos2
2 2 2
A
= r2 cot2
2
A
FE = r cot ..(1)
2
ID = r
A A
In ADIDAI = AD = r cot AD = FE
2 2
1 2 2
(16 x x y y )1 / 2
2
1
16 x 2 x y2 y 4 2( x 2 x y y 2 ) 4–1
4
2(x2 + x + y2 + y) –1
(x + 1/2)2 + (y + 1/2)2 0
which is possible only if
x = –1/2, y = –1/2
15
Time : 3 hours
Instruction :
• Calculators (in any form) and protractors are not allowed.
• Rulers and compasses are allowed.
• Answer all the questions. Maximum marks : 100
• Answer to each question should start on a new page.
Clearly indicate the questions number.
4. Let X = {1, 2, 3,.....,10}. Find the the number of pairs {A, B} such
A X. B X. A B and
A B = {5, 7, 8}.
1
(r + R)2 = (1 – r)2 + Here R = 1
4
1 1
(r + 1)2 = (1 – r)2 + ; r= .
4 16
2. Method 1 :
Consider the expansion of (a + b + c)31. All terms in it are of the
form of rkm ak b cm, where rkm is a constant (in the form of
binomial coefficient) and k, , m are non-negative integers such
that
k + + m = 31.
If k 1, 1, m 1 then abc always divides ak b cm. hence we
have to consider terms in which one or two of k, , m are zero.
Now let k = = 0, then a31 = a. a5. a25
= a. (ck1) (ck1)5
= a (ck1) (k2b k15)
= abc k16 k2
Clearly, abc divides a and similarly we can say about b31 and
31
c31.
Now let us consider two out of k, , m are not zero. Let k = 0,
, m 0 then term would be
rkm bcm, where + m = 31.
17
b c = bc b c , ,m 1
m –1 m–1
Now atleast one of –1 and m–1 must be greater than 25 and
5 respectively, which clearly shows the divisiblity of abc.
Method 2 :
a | b5 b5 = k1 a ; b | c5 c5 = k2b ; c | a5 a5 = k3c
31 31
b5 a5 b5 b25
(a + b + c)
31 b = b 5
k1 k3 k1 k1 k 3
31 31
b4 b24 b4 b24
=b
31 1 = b. b5 . b25 1
k1 k15k3 k1 k15 .k3
125 4 126 125 80
= abc k1 b k1 k1 k 3 .b
24
Which is clearly divisible by abc.
3. aabb + abba 1
Given a + b = 1
To prove that
aabb + abba aa+b + ba+b
aa(bb – ab) + ba(ab – bb) 0
(aa – ba)(bb – ab) 0 .............(1)
If a = b then above is obviously true.
If a b then assume a > b
a > b aa > ba
ab > bb bb – ab < 0 this prove (1)
4. Ans. 2186
X = {1, 2, 3, ......., 0}
So X – (A B) has 7 elements.
A will has 5, 7, 8. Rest elements can be assigned in 2 ways
'1' can either go to A of B or none.
So total pairs = 37 – (1).
(When no elements has
been assigned to A or B.)
18
9
5. Ans.
11
ADE =
3
x+y= ...(1) where x = area of APQ & y = area
3
of PQED
Consider ADC Consider AEC
AP BD CF AQ BE CF
1 1
PD CB AF QE BC AF
AP 1 1 AQ 2
1 1 1
PD 3 1 QE 3
AP AQ 3
3
PD QE 2
3
So AP = AD
4
3
AQ = AE
5
3 3
APQ = AD AF sin A
4 5
9 9 3
APQ = x= × ; x=
20 ADE 20 3 20
19
9 9
Thus (1) +y= y= 1 –
20 3 3 3 20
11
y=
3 20
3
x 20 9
= =
y 11 11
3 20
6. 32n + 3n2 + 7
(a) If n is odd n = 2k + 1
n2 is of form of 4 + 1 here
34k+2 + 3(4 + 1) + 7 9.81k + 12 + 10
k
(81) 1 mod(4)
9(81)k 1 mod(4)
32n + 3n2 + 7 3 mod(4) and a perfect square can’t be
of form of 4 + 3
(b) If n is even n = 2k
92k + 12k2 + 7
Now 92k < 92k + 12k2 + 7 (9k + 1)2
where equality will hold only at k = 1
Rest it will be in between perfect square of 9k and 9k +1
i.e. two consecutive no. Hence n = 2 is only solution.