2010 Winter Camp - Mock Olympiad - Solutions
2010 Winter Camp - Mock Olympiad - Solutions
2010 Winter Camp - Mock Olympiad - Solutions
Time: 4 Hours
1. Let ABCD be a parallelogram with AC/BD = k. The bisectors of the angles formed by AC and
BD intersect the sides of ABCD at K, L, M, N . Prove that the ratio of the areas of KLM N
and ABCD is 2k/(k + 1)2 .
Prove that there is at least one square whose edges are oriented clockwise.
3. Let Z∗ denote the set of non-zero integers. A function f : Z∗ → Z≥0 satisfies the following
properties:
1. Let ABCD be a parallelogram with AC/BD = k. The bisectors of the angles formed by AC and
BD intersect the sides of ABCD at K, L, M, N . Prove that the ratio of the areas of KLM N
and ABCD is 2k/(k + 1)2 .
Solution: Suppose K, L, M, N are on AB, BC, CD, DA, respectively. Let P = AC ∩ BD. Since
ABCD is a parallelogram, AP = P C and BP = P D. For any polygon X1 X2 · · · Xn , we denote
its area by [X1 X2 · · · Xn ].
k2 k2
[AKN ] = [ABD] = [ABCD].
(k + 1)2 2(k + 1)2
Similarly,
1 k2 1
[BKL] = [ABCD], [CLM ] = [ABCD], [DM N ] = [ABCD].
2(k + 1)2 2(k + 1)2 2(k + 1)2
Hence,
[KLM N ] = [ABCD] − [AKN ] − [BKL] − [CLM ] − [DM N ]
k2
1 2k
= 1− − [ABCD] = [ABCD],
(k + 1)2 (k + 1)2 (k + 1)2
as desired.
Prove that there is at least one square whose edges are oriented clockwise.
Solution: Let a square be called half-clockwise if its top and left sides are oriented clockwise.
Suppose that there is no clockwise square in the grid.
Consider a half-clockwise square S. Since it is not a clockwise square, either the right or bottom
edge must be oriented counterclockwise. If it is the right edge, let the square to the right of S
be T (if there are no squares to the right of S, then the right edge of S is on the border and
thus must be oriented clockwise).
Consider the top right vertex of S - it is either in the interior or on the top border of the grid.
If it is an interior vertex, it has the top and right edges of S going into it, so its other edges are
going out, in particular the top edge of T . If it is on the top border, then the top edge of T is
clockwise. In both cases, T is a half-clockwise square.
If the bottom edge of S is oriented counterclockwise, we can similarly show that the square T
below S is a half-clockwise square.
Since the top left square in the grid is half-clockwise, we can make a path of half-clockwise
squares by stepping either to the right or down. This implies that the bottom right square in the
grid is half-clockwise. However, the bottom and right edges of this square are clockwise-oriented,
so the square is clockwise. Contradiction.
3. Let Z∗ denote the set of non-zero integers. A function f : Z∗ → Z≥0 satisfies the following
properties:
Solution: The minimum possible value is 30 and the maximum possible value is 2002.
Let p be the smallest integer such that f (p) = 1. This is well defined since f (2010) = 1 > 0. I
claim that p is a prime. Suppose p = ab for some 1 < a, b < p. Then f (p) = f (a) + f (b) by (b).
Hence, at least one of f (a), f (b) = 1. This contradicts p being the smallest integer such that
f (p) > 0. Therefore, p is prime and f (1) = f (2) = · · · = f (p − 1) = 0.
For any positive integer m, write m = pr ·s where r ∈ Z≥0 and s - p. Then f (m) = f (pr )+f (s) =
r · f (p) = r. Hence, f (m) is the number of times p divides into m for a fixed prime p. We will
now verify that such a function satisfies properties (a) and (b).
Let m = pa · b and n = pc · d such that a, c ∈ Z≥0 and p - b, d. Then mn = pa+c · bd and
p - bd. Therefore, f (mn) = a + c = f (m) + f (n). Hence, f satisfies (b). Finally, without loss of
generality, suppose a ≤ c. Then m + n = pa · b + pc · d = pa (b + pc−a d). Hence p divides into
m + n at least a times. Therefore, f (m + n) ≥ a = min{a, c} = min{f (m), f (n)}. Hence, f
satisfies (a). Note that p can be chosen to be any prime number.
Since f (2010) = 1 and 2010 = 2 · 3 · 5 · 67, we conclude that all of the possible values of p are
2, 3, 5, 67. We want to find the number of times each of these values of p divide into 2010!. The
maximum and minimum possible value of f (2010!) is obtained by taking p = 2 and p = 67,
respectively.
By Cauchy-Schwarz Inequality,
p
(a2 + b2 )(a2 + c2 ) ≥ a2 + bc.
Hence, our expression is greater than or equal to
P 2
(a + b2 ) + 2 (a2 + bc) (3 a2 ) + (a + b + c)2 (3 a2 ) + 9
P P P
cyc cyc cyc cyc 3
P 2 = P 2 = P 2 = ,
6+2 a 6+2 a 6+2 a 2
cyc cyc cyc
as desired.
Solution 2: (Mixing Variables - With The Cumbersome Steps Omitted) For x, y, z > 0, let
1 1 1
f (x, y, z) = 2 2
+ 2 2
+ .
2+x +y 2+y +z 2 + z 2 + x2
Let t = a+b
2 . We will prove that f (a, b, c) ≤ f (t, t, c) ≤
3
4 to solve the problem. Without loss of
generality, suppose a ≤ b ≤ c.
We prove each of these two terms is non-negative to prove f (a, b, c) ≤ f (t, t, c).
1 1 1 1 (a − b)2
2
− 2 2
= 2 − = ≥ 0.
2 + 2t 2+a +b 2+2 2a+b 2 + a2 + b2 4 1+
a+b 2
(2 + a2 + b2 )
2
In the second term, it suffices to show that the numerator is non-negative. The numerator is
equal to
1 2 3
2
+ 2 2
≤ .
2 + 2t 2+t +c 4
This simplifies to 3t2 c2 + 3t4 + c2 − t2 − 6 ≥ 0. By substituting c = 3 − 2t, we simplify this to
proving (t − 1)2 (5t2 − 2t + 1) ≥ 0. Since the latter term has negative discriminant, this term is
indeed non-negative and therefore the inequality is true. Hence, f (t, t, c) ≤ 43 , as desired.