Professional Documents
Culture Documents
Xxxii Brazilian Math Olympiad 2010: (Page 1)
Xxxii Brazilian Math Olympiad 2010: (Page 1)
XXXII
Brazilian Math Olympiad
2010
Editora AOBM
Rio de Janeiro
2011
()
(page 0)
web: http://www.obm.org.br
e-mail: [email protected]
Chair: Luzinalva Miranda de Amorim, Carlos Yuzo Shine
Members: Antonio Caminha Muniz Neto, Carlos Gustavo Moreira, Edmilson Luis Rodrigues Motta,
Eduardo Wagner, Eduardo Tengan, Elio Mega, Flor
encio Ferreira Guimar
aes Filho, Luciano Guimar
aes Monteiro de Castro, Nicolau Corc
ao Saldanha, Onofre Campos, Pablo Rodrigo Ganassim, Paulo
Cezar Pinto Carvalho, Ronaldo Alves Garcia, Ralph Costa Teixeira, Yoshiharu Kohayakawa
Junior Members: Alex Corr
ea Abreu, Bernardo Paulo Freitas da Costa, Bruno Holanda, Carlos Augusto David Ribeiro, Carlos Stein Naves de Brito, Ccero Thiago Magalh
aes, Davi M
aximo Alexandrino Nogueira, Einstein do Nascimento J
unior, Emanuel Carneiro, F
abio Dias Moreira, Fabrcio
Siqueira Benevides, Gabriel Tavares Bujokas, Humberto Naves, Larissa Cavalcante Lima, Marcio
Assad Cohen, Samuel Barbosa Feitosa, Telmo Correa J
unior, Tertuliano Franco, Thiago Barros Rodrigues Costa, Rodrigo Villard, Yuri Gomes Lima
Executive Secretary: Nelly Carvajal Fl
orez.
Assistant Secretaries: Sonia de Souza Silva de Melo
Typeset with Plain TEX.
()
(page 1)
Introduction
1.1.
(Introduction)
(page 2)
(Introduction)
(page 3)
Problems
2.1.
Grades 67
Problem 1
Emerald has several right triangles just like the one in the diagram.
(a) Emerald made the following diagram by coinciding part of the sides
and without superposing triangles. Find the area and the perimeter of
this diagram.
(b) Following the same rules as above, Emerald constructed the smallest
square with integer side. Draw a diagram showing how she can do this.
Problem 2
The cells of a 33 table were numbered from 1 to 9, each number appearing
exactly once. For each row the cell with the greatest number is colored red
and the cell with the smallest number is colored green. Let A be the smallest
of the numbers in the red cells and B the greatest of the numbers in the
green cells.
(a) Show a distribution of the numbers in the table such that A B = 4.
(Problems)
(page 4)
Problem 3
Given a solid made of unit cubes, as in figure 1, we can write the number
of unit cubes in each direction, as shown in figure 2.
Emerald Jr made a solid out of unit cubes and drew a figure similar to figure
2.
Find a, b, c, d, e, f , x and m.
Problem 4
A positive integer n is clowny if the number obtained by reversing its digits
is greater than n. For example, 2009 is clowny because 9002 is greater than
2009; however, 2010 is not clowny because 0102 = 102 is less than 2010 and
4
(Problems)
(page 5)
Problems
Grades 89
Problem 1
See problem 4, Grades 67.
Problem 2
Let ABCD be a paralellogram and the circumcircle of the triangle ABD.
Lines BC and CD meet at E 6= B and F 6= D respectively. Prove the
circumcenter of the triangle CEF lies on .
Problem 3
Arnold and Bernold play the following game in a m n board: Arnold
chooses one of its cells and places a knight on it. Then Bernold and Arnold
move the knight alternately, with the condition that the knight visits a cell
at most once. The player who is unable to move the knight loses. Determine,
in terms of m and n, which player has the winning strategy.
Remark: the knight always moves two cells in a row or a column and then
one cell in the perpendicular direction.
Problem 4
Let a, b and c be real numbers such that a 6= b and a2 (b + c) = b2 (c + a) =
2010. Compute c2 (a + b).
Problem 5
Let O be the intersection point of the diagonals of the cyclic quadrilateral
ABCD. The circumcircles of triangles AOB and COD meet lines BC and
AD again at M , N , P and Q. Prove that the quadrilateral M N P Q is
inscribed in a circle with center O.
Problem 6
The sidelenghts and area of a triangle are all integer numbers. Find the
minimum value of its area.
(Problems)
(page 6)
2.3.
Grades 1012
Problem 1
Find all functions f from real numbers to real numbers such that
f (a + b) = f (ab)
for all irrationals a, b.
Problem 2
Let P (n) be a polynomial with real coefficients. Prove that there exist
integers n and k such that k has at most n digits and at least P (n) divisors.
Problem 3
What is the maximum area of the shadow cast by a unit cube? We understand area of the shadow of something as the area of its orthogonal
projection in a given plane.
Problem 4
Let ABCD be a quadrilateral with 6 ABC 6= 90 . Let M and N be the
midpoints of AD and CD, respectively. Prove that the lines perpendicular to BC passing through M and perpendicular to AB passing through
N and BD are concurrent if and only if the diagonals BD and AC are
perpendicular.
Problem 5
Find all values of n such that there exists a set S of n points in plane,
no three of them collinear, with the following property: one can color the
point such that if three of such points have the same color or three different
colors then they do not determine an obtuse angle. The number of colors is
unlimited.
Problem 6
Find all positive integers a, b such that
3a = 2b2 + 1.
(Problems)
(page 7)
Problems
2.4.
Undergraduates
Problem 1
Compute
Z
/4
0
x
dx.
(sin x + cos x) cos x
Problem 2
See problem 3, Grades 1012.
Problem 3
Let n be an integer and n1 be one of its divisors. Let A be a nn symmetric
matrix defined by ai,i = 4, ai,i+1 = ai+1,i = 1 for all i such that 1 i n1
and i+1 is not a multiple of n1 , ai,i+n1 = ai+n1 ,i = 1 and ai,j = 0 otherwise.
Prove that A has an inverse and that all of the entries in the inverse are
positive.
Problem 4
Define the polynomials
x
0 = 1.
x
j
x(x1)(x2)...(xj+1)
j!
Problem 5
For each finite subset F of the space R3 , define Vr (F ) as the union of the
open spheres with center on each point of F and radius r. Prove that, for
0 < r < R,
R3
vol(VR (F )) 3 vol(Vr (F )).
r
Problem 6
Prove that if 102n + 8 10n + 1 has a prime factor of the form 60k + 7, k and
n both positive integers, then n and k are both even.
7
(Problems)
(page 8)
(Problems)
(page 9)
Lösungen
3.1.
Grades 67
Problem 1
The triangle is the 345 triangle.
2
(a) Since four triangles were used, the area is 4 34
2 = 24 cm . The perimeter
is 2 (5 + 4 + (4 3) + 3) = 26 cm.
2
(b) Since the area of each triangle is 34
2 = 6 cm , the side of the square
must be a multiple of 6. Moreover, since we are covering the sides of
the square with the sides of the triangle, the side of the square must be
equal to 3x + 4y + 5z, x, y, z 0. Though 6 = 2 3, its not hard to see
that its not possible to cover a square with side 6 cm with triangles.
So the smallest square has side 12 cm and can be made of twelve 3 4
rectangles.
Problem 2
(a) For example,
7 4 1
8 5 2
9 6 3
9
(Solutions)
(page 10)
10
(c) No, its not possible. Since B = 3 is the greatest of the numbers in
green cells, which are the smallest ones in their respective rows, the
numbers 1, 2 and 3 must be on different rows. Now A = 4 means that
4 is the greatest number of a row, but it could only happen if two fo
the numbers 1, 2, 3 are on the same row as 4, which cannot happen.
Problem 3
Consider the layer 3 3 1 to the left, with numbers 2, 2, 1 on one side
and a, 3, 2. The number of unit cubes in this layer is 2 + 2 + 1 = a + 3 + 2,
so a = 0. Similarly, considering the middle horizontal layer, 2 + x + 2 =
3 + 3 + 1 x = 3. Analogously, 1 + 2 + 1 = m + 2 + 2 m = 0,
a + 1 + d = 1 + 3 + m 0 + 1 + d = 1 + 3 + 0 d = 3. Now,
2 + x + 2 = 1 + b + c b + c = 6. Since b, c 3, b = c = 3. Finally,
3+b+e = 3+3+2 3+e = 5 e = 2 and 1+c+f = 2+1+2
3 + f = 4 f = 1.
Problem 4
Let (abcd) be a four-digit number a, b, c, d being its digits. So a number is
clowny if and only if (dcba) > (abcd). This means that either d > a or d = a
and c > b. Notice that we cannot have both d = a and b = c because it
would imply (dcba) = (abcd). There are 98
2 = 36 choices in the first case
=
405
choices
in the second case (9 choices
(recall that d > a > 0) and 9 109
2
for a = d and 109
for
c
>
b
0).
So
there
are
36 + 405 = 441 four-digit
2
clowny numbers.
Problem 5
(a) For example, 900 = 22 32 52 , which has (2 + 1) (2 + 1) (2 + 1) = 27
positive divisors.
(b) No, there doesnt. Let n be a number with at least 200 divisors. If
the i-th divisor is d, then the i-th to last divisor is nd . Let m be the
n
100th divisor. So m 100 and m
> m n > m2 = 10000. Close
10
(Solutions)
(page 11)
Lösungen
11
enough, but how do we fix this? First notice that if 97, 99 and 100
are all divisors of n, then n lcm(97, 99, 100) > 11000. So the key
observation is considering the 98th, 99th and 100th divisors. Let k,
and m be such divisors. Notice that if m 105 we are done because
then n > m2 = 11025 > 11000. So 98 k < < m 104. But
km
gcd(x, y) |x y| implies that n lcm(k, , m) (k)(m)(mk)
9899100
>
11000.
Here
we
used
the
fact
that
if
x+y
2t
then
xy
t2
(10498)32
applied to x = k, y = m and t = 3.
3.2.
Grades 89
Problem 1
See problem 4, Grades 67.
Problem 2
Consider all angles oriented and modulo 180 . Let O be the center of the
circle. In the cyclic pentagonal ABEDF , 6 EBF = 6 EDF = 6 EDC =
6 CED + 6 DCE = 6 BED + 6 DCE = 6 BAD + 6 DCE = 26 DCE. This
menas that if M is the midpoint of the arc F E that does not contain A,
6 F M E = 6 EBF = 26 DCE = 26 F CE. Since M E = M F , M is the
circumcenter of triangle CEF .
Problem 3
Suppose, without loss of generality, m n. If m = 2, Arnold has winning
strategy if ond only if n is not a multiple of 4; para m 3, Arnold has
winning strategy if and only if m and n are both odd.
11
(Solutions)
(page 12)
12
Suppose m = 2. If 4 does not divide n, Arnold can win placing the knight
on the first column if n = 4k + 1 and on the second column if n = 4k + r,
r = 2 or r = 3. The knight should always be moved two columns ahead on
each move, allowing exactly 2k moves.
Now consider n = 4k. Divide the table into 2 4 subtables, and pair the
cells in such a way that its always possible to move the knight between cells
from each pair:
1 2 3 4
3 4 1 2
Since the whole table is divided into pairs, Bernold can always move, no
matter where Arnold places the knight: it suffices to motve the knight to
the other cell in the pair. When Arnold plays, he will move the knight to a
cell from another pair, and Bernold can repeat this strategy. So if n = 4k
Bernold has winning strategy.
This finishes the case m = 2. The case m 3 follows in a similar fashion,
dividing the table into smaller subtables:
1 2 3 4
3 6 1 5
2 5 4 6
1 2 3 4 5 6
3 4 1 7 8 9
2 7 8 9 6 5
1 2 3
4 A 1
2 3 4
1 2 3 4 5
3 4 6 A 7
2 1 7 5 6
Those tables prove that Bernold has winning strategy for tables 3n, n even
and Arnold has winning strategy for tables 3 n, n odd: divide the table
into one 33 or 35 subtable and several 34 subtables; it suffices to place
the knight on the cell marked with an A and then use the aforementioned
Bernolds strategy.
The case m = 4 can be verified using several 4 2 subtables if n is even and
one 4 3 subtable and several 4 2 subtables if n is odd. This also proves
that if either Arnold or Bernold has winning strategy for a m n table then
he also has winning strategy for a (m + 4) n table, m 3. So is suffices
to solve the problem for m {3, 4, 5, 6}.
The case m = 5 can be solved using the following subtables:
1 2 3 4 5 6
3 4 1 7 8 9
2 10 11 9 6 5
12 13 14 15 7 8
10 11 12 13 14 15
1 2 3
3 4 5
2 1 10
11 A 12
12 10 11
4
6
8
7
9
5
7
9
6
8
12
(Solutions)
(page 13)
Lösungen
13
Notice that Bernold has winning strategy for a 5 4 table and Arnold has
winning strategy for a 5 3 table. Thus, in the case 5 n, n even, we merge
5 4 subtables if n is a multiple of 4 and one 5 6 subtable and 5 4
subtables if n = 4k + 2; if n is odd, we merge several 5 4 subtables to a
5 3 or 5 5 subtable, if n = 4k + 3 or n = 4k + 1, respectively.
The case 6 n follows directly from the case 3 n if n is even (merge two
3 n tables) and merging 6 4 subtables to a 6 3 or 6 5 subtable, if
n = 4k + 3 or n = 4k + 1, respectively. All the cases are covered.
Problem 4
Since a 6= b, a2 (b + c) = b2 (c + a) a2 b + a2 c b2 c ab2 = 0
ab(ab)+c(ab)(a+b) = 0 ab+ca+bc = 0. So (ac)(ab+bc+ca) =
0 a2 b + abc + a2 c = abc + bc2 + ac2 c2 (a + b) = a2 (b + c) = 2010.
Problem 5
Consider angles oriented modulo 180 . Since 6 P CO = 6 BCA = 6 BDA =
ODN are inscribed in the circumcircle of the triangle OCD, OP = ON .
Analogously, OM = OQ.
6
(Solutions)
(page 14)
14
p
sidelenghts. Then its area is S = s(s a)(s b)(s c), where s = a+b+c
2 .
Since the area is also an integer, a + b + c is even, and s, s a, s b, s c
are all integers.
Now, notice that the triangle cannot be equilateral, since equilateral triangles with an integer side have irrational area. So, at least two of the
three integer numbers s a, s b, s c are distinct
and, since
s =
(s a) + (s b) + (s c) 1 + 1 + 2 = 4, S 4 2 2 1 = 8, so
S 3.
If S is even, the only relevant case is S = 4. But then all of s, sa, sb, sc
are powers of two. So if s > 4 then s 8 and s a, s b, s c would be, in
some order, 1, 1, 2, which is not possible because s = (sa)+(sb)+(sc).
If s = 4, the only possibility would be s a, s b, s c being 1, 1, 2, which
does not work either.
3.3.
Grades 1012
Problem 1
2 + ( 2) =
Let f (0) = k. Plugging a = 2 and b = 2 one obtain f
f
2( 2) f (2) = k.
Now let q Q.
The quadratic equation x2 qx 2 = 0 has discriminant
Problem 2
Let d be the degree of P , and consider d + 1 distinct primes p1 , p2 , . . . , pd+1 .
Let A = p1 p2 . . . pd+1 and kN = AN . If A has r digits, then kN has at most
rN digits. On the other hand, kN has (N + 1)d+1 positive divisors. Since P
14
(Solutions)
(page 15)
Lösungen
15
has degree d, P (rN ) < (N + 1)d+1 for all sufficiently large N , which solves
the problem.
Problem 3
Let ABCD and EF GH be two opposite faces, AE, BF , CG and DH being
edges of the cube, and let X be the orthogonal projection of point X onto
the plane. Notice that {A, G}, {B, H}, {C, E} and {D, F } are pairs of
opposite vertices. Suppose, without loss of generality, that A lies on the
boundary of the projection of the cube. Then, considering the symmetry
of the cube around the center of the cube, its symmetric point G lies on
the boundary as well. Two of the three neighboring vertices of A are going
to be neighbors of A in the projection (unless, say, face AEHD projects
onto a line; but in this case we consider a degenerate vertex inside this line).
Suppose without loss that these neighbors are B and D . So E is inside
the projection. Again by symmetry H and F lie on the boundary of the
The faces ABCD, BCGF and CDHG project onto the parallelograms (or
line segments) A B C D, B C G F and C D H G . Draw diagonals B D ,
B G and D G . The area of the projection is then twice the area of the
triangle B D G , which is at most the area of triangle BDG. This triangle
2
( 2) 3
is equilateral with side 2, so the desired maximum is 2 4
= 3.
Problem 4
Consider a homothety with center on D that takes M to A and N to C.
So the perpendicular lines are mapped to the altitudes of the triangle ABC
relative to A and C, and the intersection P of the perpendicular lines is
15
(Solutions)
(page 16)
16
Notice that the condition that the perpendicular lines and BD are concurrent is equivalent to B, P and D being collinear. But the homothety implies
that D, P and H are collinear, so the three lines are concurrent if and only
if BH and BD coincide, that is, BD AC, since BH AC.
Problem 5
We start with the following
Lemma. Every set with 5 or more points in the plane, no three of them
collinear, has three points that determine an obtuse angle. Besides, every
set with 4 points, no three of them determining an obtuse angle, is uniquely
defined by three of its points (that is, the position of one point can be
determined from the other three points).
Proof. First, notice that the points should be vertices of a convex polygon.
Otherwise, one of the points, say P , is inside a triangle with vertices on other
three points A, B, C from the set, and since 6 AP B+6 BP C +6 CP A = 360 ,
of of the three angles 6 AP B, 6 BP C, 6 CP A is greater than 90 . Finally,
since the sum of the internal angles of a convex n-gon is (n 2) 180 , one of
The second part follows from the fact that if we have four points then all
internal angles of the quadrilateral with vertices on the four points must be
equal to 90 , that is, the quadrilateral is a rectangle.
Because of the lemma, there are at most four points with either the same
color or three different colors in S. Lets prove then that S cannot have
16
(Solutions)
(page 17)
Lösungen
17
more than 12 points. If S has more than 12 points, since there are at most
four colors and more than 3 4 = 12 points then there are four points with
the same color. Besides, since there are at most four points with the same
color, there are also four points with four different colors.
Now we prove that S cannot have simultaneously four points with the same
color and four points with four different colors. Suppose, by means of contradiction, the contrary. Let P = {A, B, C, D} be a set of points from S
with the same color and E, F and G points from S with three different
colors and a different color from the points from P. So {A, E, F, G} and
{B, E, F, G} are both sets of points with four different colors. But the
lemma implies that E, F and G determine the position of both A and B,
that is A = B, contradiction.
So S has at most 12 points. Consider the following examples with 12 points:
consider the vertices of three unit squares whose centers are the vertices of
an equilateral triangle with a sufficiently large side. Color the vertices of
each square with a single color, so we have three different colors, one for
each square. The angles determine by three points of the same color are all
right angles, and the angles determined by three points with three different
color can be arbitrarily close to 60 .
It is easy to obtain set S with less than 12 points deleting points from the
examples given above. So the answer is n 12.
Problem 6
The only solutions are (1, 1), (2, 2) and (5, 11).
If a is even and greater than 2, the equation can be rewritten as (3a/2
1) (3a/2 + 1) = 2b2 . but gcd(3a/2 1, 3a/2 + 1) = gcd(3a/2 1, 2) = 2, so
3a/2 + 1 = 4u2 and 3a/2 1 = 2v 2 or 3a/2 + 1 = 2u2 and 3a/2 1 = 4v 2 .
In the former case, 3a/2 = (2v 1)(2v + 1), and since gcd(2v 1, 2v + 1) =
gcd(2v 1, 2) = 1, 2v 1 = 1 v = 1 and a/2 = 1 a = 2 and
thus b = 2.
and
( 3 + 2)2k+1 = ck 3 + bk 2 y
( 3 2)2k+1 = ck 3 bk 2 ()
17
(Solutions)
(page 18)
18
3+ 2
< 9 3 + 11 2
3 + 2 <
(5 + 2 6)k1
Its
hard to prove by induction that ( 3+
2) (5 2 6)k1 =
not
1
=
3 + 2, and both integers. Moreover, 3 + 2 > 1 > 3+
2
Thus 3 divides
+ 1. Let 3t be the largest power of 3 that divides 2k + 1.
2k k1
2k+1
= (2k + 1) k (2k 1) 22k1 , the largest power of
Since 3 3 2
3 that divides the second term of the right hand side of ( ) is also 3t
s
and, letting
be the largest power of 3 that divides 2m + 1, the m-th term
m 3km
s
2k+1
2k+1 2k
m
km
= 2m+1
has at least t + m s t + 3 2+1 s
2m+1 3 2
2m 3 2
factors 3 (t from 2k + 1, m from 3m , minus s from 2m + 1). Since 3s =
s
(1 + 2)s 1 + 2s 3 2+1 s 1 for s 0, with equality if and only if
s = 0 or s = 1, the m-th term has more than t + 1 factors 3 except when
s
m = 3 2+1 . If s = 0 we have m = 1 2m + 1 = 3, a known solution; if
s = 1 we have m = 2 which has no factors 3. Thus, since k > 1, all terms
starting from the third one have at least t + 2 factors 3, and
c = (2k + 1) 2k + (2k + 1) k (2k 1) 2k1 + 3t+2 N
3(a1)/2 = (2k + 1) 2k1 [(2k + 1)(k 1) + 3] + 3t+2 N
Notice that since 3 divides (2k + 1) then it also divides (2k + 1)(k 1) + 3;
moreover, 9 divides (2k + 1)(k 1), and then the largest power of 3 that
divides (2k + 1)(k 1) + 3 is 3. Hence the largest power of 3 that divides
(2k + 1) 2k1 [(2k + 1)(k 1) + 3] is t + 1 (t factors from 2k + 1 and 1 from
(2k + 1)(k 1) + 3). Finally,
3(a1)/2 = c = 3t+1 (1 + 3N ),
which is impossible because N > 0.
So there are no more solutions.
18
(Solutions)
(page 19)
Lösungen
3.4.
19
Undergraduates
Problem 1
First notice the identity sin x + cos x = 2 cos x cos 4 + sin x sin 4 =
2 cos 4 x . So
Z /4
Z /4
x
x
dx =
dx
I=
(sin
x
+
cos
x)
cos
x
2 cos 4 x cos x
0
0
Now consider the substitution y = 4 x. So dx = dy and
Z /4
Z 0
x
4 y
dy
dx
=
2 cos 4 x cos x
2 cos y cos 4 y
0
/4
Z /4
Z /4
4 y
4 x
dx
dy
=
=
2 cos y cos 4 y
2 cos 4 x cos x
0
0
x
4 x
2I =
dx
+
dx
2
cos
2
cos
x
cos
x
0
0
4
4 x cos x
Z /4
Z /4
4 x+x
4
dx
=
dx
=
x
cos
x
2
cos
2
cos
0
0
4
4 x cos x
So I =
R /4
0
1
(sin x+cos x) cos x dx.
Let f (x) = ln(sin x + cos x) and g(x) = ln(cos x). Notice that f (x) =
cos2 xsin x cos x
sin x
sin2 x+sin x cos x
cos xsin x
sin x+cos x = f (x) = (sin x+cos x) cos x and g (x) = cos x = (sin x+cos x) cos x . So
f (x) g (x) =
1
(sin x+cos x) cos x .
Hence
/4
1
f
g
(f (0) g(0))
dx =
(sin x + cos x) cos x
8
4
4
0
!
!
2
ln 2
ln( 2) ln
ln 1 + ln 1 =
=
8
2
8
I=
Problem 2
See problem 3, grades 1012.
19
(Solutions)
(page 20)
20
Problem 3
Lets find the inverse of A/4 = I X, where all entries in X are either 0 or
1/4. We will use the series
(I X)1 = I + X + X 2 + X 3 +
First lets prove that this series converges. It suffices to show that the
maximum M such that kXwk M kwk for all column vectors w of X is less
than 1, so the sum of the entries always decrease by a factor smaller than 1
if you multiply a vector by X 2 ; then we sum the series as (I + X)(I + X 2 +
X 4 + ). Notice that every row of X has at most four nonzero entries, all
of which are equal to 1/4. So if w = (a1 , a2 , . . . , an ) then every entry of Xw
a +a ++ars
is of the form r1 r24
, s 4. By the Cauchy-Schwarz inequality, its
a2 +a2 ++a2
rs
s
(a2r1 + a2r2 + + a2rs ) r1 r24
, with equality if and
square is at most 16
only if ar1 = ar2 = = ars and s = 4. Summing over all the rows, the sum
of squares of the coordinates of Xw is at most a21 + a22 + + a2n = kwk2 ,
because all columns of X have at most four nonzero entries. But equality
would only happen if all entries ai are equal and s = 4 always, which does
not happen for, say, the first row. So M < 1 and the series converges.
(Solutions)
(page 21)
Lösungen
21
P
(b) We have xn = nk=0 c(n, k) xk , so
n
X
x
n+1
c(n, k)
x
x
=
k
k=0
n
n
X
X
x
x
c(n, k)
c(n, k)
=
(x + 1)
k
k
k=0
k=0
n
n
X
X
x
x+1
c(n, k)
c(n, k)(k + 1)
=
k
k+1
k=0
k=0
n
n
X
X
x
x
x
c(n, k)(k + 1)
=
+
c(n, k)
k+1
k
k
k=0
k=0
n
X
x
(c(n, k 1)k + (k + 1 1)c(n, k))
=
k
k=0
n
X
x
k(c(n, k 1) + c(n, k))
=
k
k=0
c(n,k)+c(n,k1)
c(n+1,k)
1
k,
and
1
k+1 .
Problem 5
Let F = {P1 , P2 , . . . , Pn } and let ij be the perpendicular plane bisector of
Pi and Pj for i 6= j. Those planes define n convex regions R1 , R2 , . . . , Rn ,
where Ri is the intersection of the half-spaces determined by ij that contain
Pi . Finally, let Ar (i) be the intersection of Ri with the sphere with center
Pi and radius r. Thus, since the (disjoint) union of the regions Ri is the
whole space, Vr (F ) is the disjoint union of Ar (1), Ar (2), . . ., Ar (n).
Now, for each point Pi , apply a homothety with center Pi and ratio r/R < 1.
It is clear that the image of AR (i) is contained in Ar (i), since a sphere with
radius R is taken to a sphere with radius r and the planes ij are taken to
3
planes ij
closer to Pi . Thus vol(Ar (i)) Rr vol(Ar (i)) and the result
follows by summing up these inequalities for i = 1, 2, . . . , n.
Problem 6
Let p = 60k + 7 be such a prime. Then 102n + 8 10n + 1 0 (mod p)
(10n 1)2 10n+1 (mod p). Now suppose n is odd. Then (10n 1)2
21
(Solutions)
(page 22)
22
22
(Solutions)
(page 23)
Winners in 2010
23
4.1.
Grades 67
Gold medals
(Winners in 2010
(page 24)
24
(Winners in 2010
(page 25)
Winners in 2010
25
Grades 89
Gold medals
Rafael Rodrigues Rocha de Melo
Vincius Canto Costa
Henrique Vieira G. Vaz
Fellipe Sebastiam da Silva P. Pereira
Roberto Tadeu Abrantes de Ara
ujo
Pedro Victor Falci de Rezende
25
(Winners in 2010
(page 26)
26
Silver medals
Alessandro A. de Oliveira Pacanowski
Lincoln de Queiroz Vieira
Tadeu Pires de Matos Belford Neto
Vitor Ramos de Paula
Francisco Markan Nobre de Souza Filho
Jair Gomes Soares J
unior
Breno Soares da Costa Vieira
Gabriel Jose Moreira da Costa Silva
Pedro Morais de Arruda Siaudzionis
Gabriel Sena Galvao
Fabio da Silva Soares
Michel Rozenberg Zelazny
Bruno Eidi Nishimoto
Franco Matheus de Alencar Severo
Aime Parente de Sousa
Bronze medals
Marcos Paulo Nunes de Lima Silva
Gabriel Nogueira Coelho de Togni de Souza
Rafael Tedeschi Eugenio Pontes Barone
Murilo Corato Zanarella
Rodrigo Sanches Angelo
Alexandre Perozim de Faveri
Luze Mello Durso Vianna
Maria Clara Cardoso
Liara Guinsberg
Lucas Cawai Juliao Pereira
Luis Guilherme Gomes Aguiar
Carlos Adriano Vieira
Daniel Santana Rocha
Raphael Mendes de Oliveira
Samuel Brasil de Albuquerque
Gustavo Souto Henriques Campelo
Honorable mention
Lucas de Moura Herlin
Vitor Dias Gomes Barrios Marin
Joao Pedro Sedeu Godoi
26
(Winners in 2010
(page 27)
Winners in 2010
27
27
(Winners in 2010
(page 28)
28
4.3.
Grades 1012
Gold medals
Gustavo Lisb
oa Empinotti
Marcelo Tadeu de Sa Oliveira Sales
Joao Lucas Camelo Sa
Hanon Guy Lima Rossi
Maria Clara Mendes Silva
Silver medals
Matheus Secco Torres da Silva
Lucas Lourenco Hernandes
Deborah Barbosa Alves
Henrique Gasparini Fiuza do Nascimento
Luiz Filipe Martins Ramos
Andre Macieira Braga Costa
Thiago Saksanian Hallak
Victor Juca Martins
Caque Porto Lira
Gustavo Haddad Francisco e Sampaio Braga
Alvaro
Lopes Pedroso
Andre Amaral de Sousa
Bronze medals
Marcos Massayuki Kawakami
Carlos Henrique de Andrade Silva
Rafael Kazuhiro Miyazaki
Andre Saraiva Nobre dos Santos
Daniel Eiti Nishida Kawai
Lucas de Freitas Smaira
C
assio dos Santos Sousa
Alessandro Macedo de Ara
ujo
Breno Vieira da Silva Passos
Iago Dalmaso Brasil Dias
Isabella Amorim Goncalez
Daniel dos Santos Bossle
Davi Coelho Amorim
Lucas Mestres Mendes
Vincius Gomes Pereira
28
(Winners in 2010
(page 29)
Winners in 2010
29
29
(Winners in 2010
(page 30)
30
4.4.
Undergraduates
Gold medals
(Winners in 2010
(page 31)
Winners in 2010
31
Erik
Fernando de Amorim
Daniel Ungaretti Borges
Ant
onio Deromir Neves Silva J
unior
Rafael Parpinel Cavina
Isaque Santa Brigida Pimentel
Mateus Oliveira de Figueiredo
Davi Dos Santos Lima
Bruno da Silva Santos
Francisco Osman Pontes Neto
Breno Vieira de Aguiar
Ricardo Turolla Bortolotti
Guilherme Philippe Figueiredo
Daniel de Barros Soares
Hudson do Nascimento Lima
Eduardo Fischer
Luty Rodrigues Ribeiro
Jose Leandro Pinheiro
Caio Ishizaka Costa
Gabriel Caser Brito
Leonardo Donisete da Silva
Alan Anderson da Silva Pereira
Diego Andres de Barros Lima Barbosa
Renato Dias Costa
Ivan Guilhon Mitoso Rocha
Willy George do Amaral Petrenko
Leonardo Borges Avelino
Jose Armando Barbosa Filho
31
(Winners in 2010