Singapore Mathematical Olympiad 2010 Open Solution
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 11
Singapore Mathematical Society
1)
o
+ 360n - 400 27
Note that --------- - 34n + 61 + .
2n - 7 2n - 7
an integer for all integers n, we must have that 27 divisible 2n - 7.
-1,1, 3, 9, so that n = 3,4,2,5, -1,8, - 17. Hence the ro,nnCrDrJ
50.
2. Answer: 199
By direct computation,
- 4x - 396011 2: + 4x - 396011
-<====? (x2 - 4x 39601)2 - (x2 + 4x - 39601)22: 0
-<====? 2( x2 - 39601) ( -8x) 2: 0
-<====? x(x + 199)(x - 199) ~ 0,
we conclude that the largest possible value of x is 199.
3.
1159
Note
+ ... +
+ 3+· .. +
+2 19
19(8000) - L k3
k=l
+ ... + 18
+3
115900
x
.'. llOOJ = 1159.
50
-34n+
is
+
4. 65
6n
Define f(n) = , for n = 1,2,3,···. It is clear that f(l) = 6, f(2) = 18, f(3) = 36, f(4) = n.
and f(5) = 64.8. For all n 2 6,
6n 6 6 6 6 6 6
f(n) = -, < - x - x - x - x - x - = 6 x 3 x 2 x 1.8 = 64.8 n. - 1 2 3 4 5 6
5. Answer: 78
Extend DC meeting r2 at H. Note that DN = NC = power with respect to r1 and r2. Thus M N M H = MC· MC(MN + 60) giving MN = MC. Thus MN = 30.
= 60. Since M is of equal That is MN(MC+60) =
The power of N with respect to r1 is DN· NC = 602, and is equal to NA· NB = N A· (AB - N A) = N A· (122 - N A). Thus N A· (122 - N A) = 602. Solving this quadratic equation, we get NA = 72 or 50. Since NA > NB, we have NA = 72. Consequently AM = VNA2 + MN2 = V722 + 302 = 78.
6. Answer: 2500
By
50 50 50 1
< ,
k=l k=l k=l Xk
= 50 = 1,. .,50. the
2500.
7. Answer: 26 Let (x - p)(x -13) +4 = (x+q)(x+r). Substituting x = -q into the above identity
(-q - (-q - + p)(q + 13) = -4. p and q are intezers
For case (b), we obtain q = -12,p = 8 and hence (x - p)(x - 13) + 4 = (x - 9)(x-
For case (c), we obtain q = -15, p = 17 and hence (x - p)(x - 13) + 4 = (x - 15)2; which is NOT what we want;
For case (d), we obtain q = -H,p = 9 and hence
is also NOT we want. Hence the two values pare 8 and
is 26.
8. Answer: 8038 First, note that
1)2
+k
Next, observe that (n + I? > 2010 is equivalent to n2 - 8038n + 1 > 0, which is 4n
to n(n - 8038) > -1. Since n is a positive integer, the last inequality is satisfied if
only if n 2': 8038. Consequently, the least n required is 8038.
9. Answer: 45
Let d = AC = 24. First, it is not difficult to see that LDEB = LACB and LEDB = LCAB, so that the triangles DBE and ABC are similar.
Let M and N be the feet of the
x 1 x BM x DE = 1 x 1:. X 5d = 5d2 Substituting d = 24,
2 2 4 8 64 .
45.
area the triangle B D E
52
10. 4
We note that f(x) = (x + 1)3 + 3(x + 1) + 10. Let g(y) = y3 + 3y, which is a strictly increasing odd function. Hence f(a) = 1 implies g(a + 1) = -9 and f(b) = 19 implies g(b + 1) = 9. Thus, a + 1 = -(b + 1), implying a + b = -2, so that (a + b)2 = 4.
Let = tan o , y = tanj3 and z = taw-yo Then
xy + yz + zx xyz
4 5 17
6 17
x+y+z x+y+z xyz
5
5 2
From the above three equations, xyz = -6 and xy + yz + zx = 3' It follows that
r:l ) X + y + z - xyz 17/6 - (-5/6)
+ l-' + r = = = 11.
1 - (xy + yz + zx) 1 - 2/3
12. Answer: 22023 Include the all possible routes:
I,
P in the
as
N
E
8 km
B
km
F
G
H
J I K
L lM
I
!
N
P A
For the route A -+ E -+ there is way.
For the route A -+ F -+ B, there are C2) . (~) = 80 ways.
For the route A -+ G -+ B, there are (12°) . (~) = 1260 ways.
53
the route A --+ H --+ I --+
there are
= 980 ways.
For the route A --+ J --+ I --+ B, there are (~) . (D . (~) = 5880 ways. For the route A --+ J --+ K --+ B, there are (~) . (~) = 1176 ways.
For the route A --+ L --+ I --+ B, there are = 7350 ways.
For the route A --+ L --+ K --+ B, there are (:) . (;) . (~) = 4410 ways. For the route A --+ L --+ M --+ B, there are (:) . (;) = 490 ways.
For the route A --+ N --+
there are
2
= 385 ways.
For the route A --+ P --+ B, there are (1/) = 11 ways. Hence, by adding up, there are altogether 22023 ways.
13. Answer: 4021
n-1 Rearranging the recurrence relation yields an+l - an = -n+1 for n 2: 3, we have
n-2 -2 n-3
--(an-l - an-2) = --. --(an-2-
n ri n-1
n-2 n-3 2 1
... = -- . -- ... - . -(a2 - al)
n. n-1 4 3
222
n. -1 n
2
for n > 3. Using the method of difference, we obtain an = 3 - - n 2:
2009
an> 2+ --, we have
-->
the least value
- 8 sin
8 + 8 sin - 8 - 8 sin
9 + 8 sin 100 - 8 (2 sin 300 cos 200)
9 + 8 sin - 8 (1 - 2
+1
.'. V9 - 8sin50°
+ 4sin
1 + 4sin 100.
b+c
Thus, a = 1, b = 4 and c = 10, and hence -- = 14. a
54
It can be easily seen that the given equation has exactly one root 0:, since (1) all polynomial equations of degree 5 has at least one real root, and (2) the function f(x) = x5 - x3 + X - 2 is strictly increasing since f' (x) = 5x4 - 3x2 + 1 > 0 for all real values of x,
1
It can also be checked that f(~) < 0 and f(2) > 0, so that 2" < 0: < 2. This is equivalent to
the last inequality is always true. Hence 3 ::::; 0:6 < 4, thereby showing that l 0:6 J = 3.
16. Answer: 8030
odd number greater than 1 can be written as 2k+1, where 2k+1 = (k+l)2-k2, all odd integers greater than 1 are not "cute" integers. Also, since 4m = (m+ so that all integers of the form 4m, where m > 1, are not "cute". We claim that all integer of the form 4m + 2 are "cute". Suppose 4m + 2 (for m 2:: 1) is not "cute", then
4m + 2 = x2 _ y2 = - y) + y)
for some integers positive integers x and y. However, + y and x - parity, so that x - y and x + y must all be even since 4m + 2 is even,
4, is absurd. 4m + 2 is first
are 1,2,4,6,10· . '. n > 3, the is 4n - = 8030,
841
= 7,
-x-
+ -1),
where g(x) is a polynomial in x of degree 3. Hence g(l) = = 0,
g(4) = 3. Thus
Thus, f( -1) = -29, so that its square is 841.
55
18.
18
Solving for b, we get b = lO;-'=tolOOO. Since a and b are positive, we must have a > 100.
L here rn is a nositi . 100(100+m)+100 100 10100
et a = 100 + m, were m IS a positive mteger. Thus b = m = + ---:m:-.
Therefore m must be a factor of 10100 = 101 x 22 x 52. Conversely, each factor r of
m determines a unique solution (a, b) = (100 + r, 100 + lO~OO) the equation +
b) = ab - 100. There are 18 = (1 + 1)(2 + 1) + 1) factors 10100.
a contradiction too. Thus k = 1 and b = 3. Therefore
p = + = 8 + 9 = 17.
20.
10045
the
vertices
(11-1)x
no on and (1 ,
points, since for any point (x, y) on this segment between (0,0)
20l0x y=--. 1
2°AOx is not an H~Cl~F,v," Hence the number of grid points (x, y) inside the triangle formed by corner points (0,2010) and (11,2010) is
But
an integer x with 1 ::; x ::;
(11 - 1) x (2010 - 1)/2 = 20090/2 = 10045.
56
For 1,2010), we have
inside the
corner
1 < Y < 2009,
lly 1 < x < --.
- 2010
Thus, for any fixed positive integer y, there are the number of grid points satisfying condition that 1 ~ x < i~{o is
as 210\YO is not an integer when 1 ~ Y ~ 2009. the number
the triangle formed by corner points 0), (0,2010) and (11,2010) is
III J III x 2J III x 3J III x 4J III x 2009J
2010 + 2010 + 2010 + 2010 + ... + 2010 .
answer is 10045.
21. Answer: 2007
n distinct numbers where n 2: 3.
IS 3 n 2: 3. Hence
also n - 3.
If = 3, then there are no friendly pairs as each number is ~Ul~~'"U
Thus the number of friendly is O. the number of
arrangement of n distinct numbers on the circle is n - 3 for some n 2: 3. Consider n + 1
on the Let m be the
on circle after deleting m. The two numbers adjacent to m which originally form a pair do not form a friendly pair anymore. Any other friendly pair remains a friendly when m is deleted. On the other hand, any friendly pair after m is deleted was originally
a friendly pair. By induction hypothesis, there are n - 3 friendly after is UC:;l.CH:OU
Therefore, there are (n + 1) - 3 friendly pairs
22.
12345
We
+
+
z.
= 0 into = 0 into
x = 0 in we
f(yf(z))
zf(y).
into (3) we
for all real z. Now, using (2) and (4), we obtain
57
y=z=
also
Comparing (5) and (6), it follows that x2f(l) xf(x), so that if x is non-zero, then
f(x) = cx for some constant c. Since f(O) = 0, we also have cx for all real values
of . , we have that + + cyz.
is = 12345.
so
c= all real values of
23. Answer: 86422
The number of ways of choosing r objects from n different types of objects of which repetition is allowed is (n + ~ - 1). In particular, if we write r-digit numbers
digits for with the condition that the digits appear in a
+ r - 1) ways the
we following enumeration
elements, the cumulative sum is also computed:
Numbers used other n r (n + ~ - 1) Cumulative
Beginning with than the fixed
part
1 1,0 2 5 G)=6 6
2 2,1,0 3 5 (~) = 21 I 27
3 3,2,1,0 4 5 (~) = 56 83
4 4,3,2,1,0 5 5 G) = 126 209
5 5,4,3,2,1,0 6 5 C50) = 252 461
6 6,5,4,3,2,1,0 I 7 I 5 C51) = 462 I
7 7,6,5,4,3,2,1,0 18 5 c:) = 792
I
From 800000 5,4, ! C2)
,
855555
860000 3,2, , 4 4 (:) = I
I
863333 I I The next 6-digit numbers are:
24. Answer: 309
Let S be the set of permutations of the six integers from 1 to 6. Then lSI = 6! = 720. P( i) to be the subset of S such that the digit i + 1 follows immediately i, i = 1,2,3,
