Académique Documents
Professionnel Documents
Culture Documents
1. Let ABCDEF be a convex hexagon in which the diagonals AD, BE, CF are concurrent
at O. Suppose the area of traingle OAF is the geometric mean of those of OAB and
OEF ; and the area of triangle OBC is the geometric mean of those of OAB and OCD.
Prove that the area of triangle OED is the geometric mean of those of OCD and OEF .
Solution: Let OA = a, OB = b, OC = c,
OD = d, OE = e, OF = f , [OAB] =
x, [OCD] = y, [OEF ] = z, [ODE] = u,
[OF A] = v and [OBC] = w. We are given
that v 2 = zx, w2 = xy and we have to
prove that u2 = yz.
Since AOB = DOE, we have
E
u
d
y
O
f
v
F
a
1
de sin DOE
u
de
= 2
= .
1
x
ab
ab sin AOB
2
x
B
Similarly, we obtain
fa
v
=
,
y
cd
w
bc
=
.
z
ef
(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.
Thus the number of 4-digit numbers, having non-zero digits, and divisible by 4 but not
by 8 is
198 + 162 + 207 + 162 = 729.
Alternative Solution:. If we take any four consecutive even numbers and divide them
by 8, we get remainders 0,2,4,6 in some order. Thus there is only one number of the
form 8k + 4 among them which is divisible by 4 but not by 8. Hence if we take four even
consecutive numbers
1000a + 100b + 10c + 2,
there is exactly one among these four which is divisible by 4 but not by 8. Now we
can divide the set of all 4-digit even numbers with non-zero digits into groups of 4 such
2
www.examrace.com
consecutive even numbers with a, b, c nonzero. And in each group, there is exactly one
number which is divisible by 4 but not by 8. The number of such groups is precisely
equal to 9 9 9 = 729, since we can vary a, b.c in the set {1, 2, 3, 4, 5, 6, 7, 8, 9}.
4. Find three distinct positive integers with the least possible sum such that the sum of the
reciprocals of any two integers among them is an integral multiple of the reciprocal of
the third integer.
Solution: Let x, y, z be three distinct positive integers satisfying the given conditions.
We may assume that x < y < z. Thus we have three relations:
1 1
a
+ = ,
y z
x
1 1
b
+ = ,
z x
y
1 1
c
+ = ,
x y
z
1
r
=
,
y
b+1
1
r
=
.
z
c+1
1 1 1
r
r
r
+ + =
+
+
,
x y z
a+1 b+1 c+1
or
1
1
1
+
+
= 1.
a+1 b+1 c+1
(1)
1
1
3
1
+
+
<
.
a+1 b+1 c+1
a+1
Thus a < 2. We conclude that a = 1. Putting this in the relation (1), we get
1
1
1
1
+
=1 = .
b+1 c+1
2
2
Hence b < c gives
1
2
<
.
2
b+1
Thus b + 1 < 4 or b < 3. Since b > a = 1, we must have b = 2. This gives
1
1 1
1
= = ,
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 <
1
1
l
a < b. Otherwise we should have + = = l for some integer l. Hence we obtain
a
b
1
a+b
= l showing that a b and b a. Thus a = b contradicting a 6= b. Thus the least
ab
number should be 2. It is easy to verify that (2, 3, 4) and (2, 3, 5) are not solutions and
(2, 3, 6) satisfies 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.
3
www.examrace.com
BIC = 90 +
A
= 90 + 30 = 120 .
2
AF E = ABE + BEF =
B A
+
.
2
2
=
= F CM.
2
2
2
This implies that F, M, C, A are concyclic. It follows that
F AM = 90 AF E = 90
C
= F AM.
2
Hence F M A is an isosceles triangle. But F L AM . Hence L is the mid-point of AM
or AL = LM .
"
#
n
6. For each integer n 1, define an = , where [x] denotes the largest integer not
n
exceeding x, for any real number x. Find the number of all n in the set {1, 2, 3, . . . , 2010}
for which an > an+1 .
F M A = F CA =
Solution: Let us examine the first few natural numbers: 1,2,3,4,5,6,7,8,9. Here we see
that an = 1, 2, 3, 2, 2, 3, 3, 4, 3. We observe that an an+1 for all n except when n + 1
is a square in which case an > an+1 . We prove that this observation is valid in general.
Consider the range
m2 , m2 + 1, m2 + 2, . . . , m2 + m, m2 + m + 1, . . . , m2 + 2m.
Let n take values in this range so that n = m2 + r, where 0 r 2m. Then we see that
[ n] = m and hence
"
#
hri
n
m2 + r
=
=m+
.
m
m
n
m times
range. But when n = (m + 1)2 , we see that an = m + 1. This shows that an1 > an
whenever n = (m + 1)2 . When we take n in the set {1, 2, 3, . . . , 2010}, we see that the
only squares are 12 , 22 , . . . , 442 (since 442 = 1936 and 452 = 2025) and n = (m + 1)2 is
possible for only 43 values of m. Thus an > an+1 for 43 values of n. (These are 22 1,
32 1, . . ., 442 1.)
-00-
4
www.examrace.com