(page 1)

XXXIII
Brazilian Math Olympiad
2011
Editora AOBM
Rio de Janeiro
2012
()
(page 0)
Instituto Nacional de Matematica Pura e Aplicada IMPA
Chair: Cesar Camacho
Sociedade Brasileira de Matematica (Brazilian Mathematical Society)
Chair: Hilario Alencar
Support
Conselho Nacional de Desenvolvimento Cientco e Tecnologico CNPq
Instituto do Milenio Avan co Global e Integrado da Matematica Brasileira
Comissao Nacional de Olimpadas de Matematica (Mathematical Olympiads National Com-
mittee)
Estrada Dona Castorina, 110 Jardim Botanico 22460-320 Rio de Janeiro RJ
Telefone: (21) 2529-5077 Fax: (21) 2529-5023
web: http://www.obm.org.br
e-mail: obm@impa.br
Chair: Carlos Gustavo Tamm de Ara ujo Moreira, Onofre Campos da Silva Farias
Members: Antonio Caminha, Francisco Bruno Holanda, Carlos Yuzo Shine, Ccero Thiago Ber-
nardino Magalh aes, Edmilson Luis Rodrigues Motta, Eduardo Tengan, Eduardo Wagner, Emanuel
Carneiro,

Elio Mega, Fabio Brochero, Luciano Guimar aes Monteiro de Castro, Luzinalva Miranda
de Amorim, Nicolau Cor cao Saldanha, Pablo Rodrigo Ganassim, Paulo Cezar Pinto Carvalho, Ralph
Costa Teixeira, Samuel Barbosa Feitosa, Yoshiharu Kohayakawa, Yuri Lima
Junior Members: Alex Correa Abreu, Bernardo Paulo Freitas da Costa, Carlos Augusto David
Ribeiro, Carlos Stein Naves de Brito, Davi M aximo Alexandrino Nogueira, F abio Dias Moreira,
Fabrcio Siqueira Benevides, Gabriel Tavares Bujokas, Humberto Naves, Larissa Cavalcante Lima,
Marcio Assad Cohen, Telmo Correa J unior, Thiago Barros Rodrigues Costa, Rodrigo Villard
Executive Secretary: Nelly Carvajal Florez
Assistant Secretaries: Rosa Morena Freitas Kohn
Typeset with Plain T
E
X.
()
(page 1)
Introduction
1.1. Structure of the Brazilian Math Olympiad
The Brazilian Math Olympiad is a nationwide competition for students
from grade 6 to undergraduates, comprising a total of approximately 400000
contestants. Students from grade 6 to 12 have to take three rounds: the
rst round is held in June and consists in multiple choice questions, 20
for grades 6 and 7 and 25 for grades 8 to 12. Approximately 10% of these
students qualify to the second round in late September, which has two types
of problem: questions in which only the answer, which is an non-negative
integer less than 10000, is required and problems in which full solutions are
required. At the same time, undergraduates take the rst round, which
consists in a six-problem test (full solutions required).
Finally, approximately 200 to 400 students in each level go to the nal
round, held in late October. Grades 6 and 7 have only one test with ve
problems; all other students have two tests in two consecutive days, each
one with three problems.
The winners are announced in early December and invited to go to a week-
long training camp in late January named Olympic Week. They are in-
formed about the selection process of international olympiads like IMO,
Cono Sur Olympiad and Iberoamerican Olympiad.
The selection process to both IMO and Cono Sur Olympiad usually consists
in three or four team selection tests and three or four problem sets that the
students receive. The Cono Sur Olympiad team is usually announced in
April and the IMO team is announced in late April or early May. The Cono
Sur team goes to a training camp the week before the competition; the IMO
team has a training camp three weeks before IMO.
1
(Introduction)
(page 2)
(Introduction)
(page 3)
3 Problems
2.1. Grades 67
Problem 1
Emerald wrote on the blackboard all the integers from 1 to 2011. Then she
erased all the even numbers.
(a) How many numbers were left on the board?
(b) How many of the remaining numbers were written with only the digits
0 and 1?
Problem 2
We have a red cube with sidelength 2 cm. What is the minimum number
of identical cubes that must be adjoined to the red cube in order to obtain
a cube with volume
_
12
5
_
3
cm?
Problem 3
We call a number pal if it doesnt have a zero digit and the sum of the squares
of the digits is a perfect square. For example, 2115522 is pal (because
2
2
+ 1
2
+ 1
2
+ 5
2
+ 5
2
+ 2
2
+ 2
2
= 8
2
but 304 and 12 are not pal.
(a) What is the greatest two-digit pal number?
(b) Does there exist a 2011-digit pal number?
Problem 4
In the diagram, O is the center of the square, OA = OC = 2, AB = CD = 4,
CD is perpendicular to OC, which is perpendicular to OA, which in turn
is perpendicular to AB. The square has area 64 cm
2
.
3
(Problems)
(page 4)
4 XXXIII Brazilian Math Olympiad 2011
(a) Compute the area of trapezoid ABCO.
(b) Compute the area of quadrilateral BCDE.
Problem 5
Emerald writes the integers from 1 to 9 in a 33 table, one number in each
cell, each number appearing exactly once. Then she computes eight sums:
the sums of three numbers on each row, the sums of the three numbers on
each column and the sums of the three numbers on both diagonals.
(a) Show a table such that exactly three of the eight sums are multiples of
3.
(b) Is it possible that none of the eight sums is a multiple of 3?
2.2. Grades 89
Problem 1
Emerald writes the integers from 1 to 9 in a 33 table, one number in each
cell, each number appearing exactly once. Then she computes eight sums:
the sums of three numbers on each row, the sums of the three number on
each column and the sums of the three numbers on both diagonals. Is it
possible that none of the eight sums is a multiple of 3?
Problem 2
Let ABCD be a convex quadrilateral such that AD = DC, AC = AB and

ADC =

CAB. Let M and N be the midpoints of AD and AB. Prove
that triangle MNC is isosceles.
Problem 3
Emerald and Jade play the following game: Emerald writes a list with 2011
positive integers, but does not show it to Jade. Jades goal is nding the
product of the 2011 numbers in Emeralds list. In order to do so, she is
allowed to ask Emerald the gcd or the lcm of any subset with at least two
of the 2011 numbers (as, for instance, what is the gcd of the rst, second,
10th and 2000th numbers from your list? or what is the lcm of all the
numbers in your list?). Jade can make as many questions as she wants,
but can only obtain her (correct) answers from Emerald after making all
her questions (Emerald is generous and also says which answer corresponds
to each question). Jade then can use any of the four elementary operations
(add, subtract, multiply, divide) with Emeralds answers. Can Jade make a
list of questions that guarantees that she can nd the product of the 2011
numbers?
4
(Problems)
(page 5)
Problems 5
Problem 4
Emerald wrote a list of positive integers. Renan noticed that each number
in the list and any sum of any quantity of distinct numbers from the list were
square-free (that is, not divisible by any perfect square except, of course, 1).
What is the maximum quantity of numbers that Emeralds list can have?
Problem 5
Consider 1000 points inside a square with sidelength 16. Prove that there is
an equilateral triangle with sidelength 2

3 that covers at least 16 of those

points.
Problem 6
For each positive integer N with 2k digits, let odd(N) be the k-digit number
obtained by writing the digits of odd order of N and even(N) be the k-digit
number obtained by writing the digits of even order of N. For example,
odd(249035) = 405 and even(249035) = 293. Prove that there is no positive
integer N with 2k digits such that N = odd(N) even(N).
2.3. Grades 1012
Problem 1
We call a number pal if it doesnt have a zero digit and the sum of the
squares of the digits is a perfect square. For example, 122 and 34 are pal
but 304 and 12 are not pal. Prove that there exists a pal number with n
digits, n > 1.
Problem 2
33 friends are collecting stickers for a 2011-sticker album. A distribution
of stickers among the 33 friends is incomplete when there is a sticker that
no friend has. Determine the least m with the following property: every
distribution of stickers among the 33 friends such that, for any two friends,
there are at least m stickers both dont have, is incomplete.
Problem 3
Prove that, for all convex pentagons P
1
P
2
P
3
P
4
P
5
with area 1, there are
indices i and j (assume P
6
= P
1
and P
7
= P
2
) such that:
area P
i
P
i+1
P
i+2

5

5
10
area P
j
P
j+1
P
j+2
5
(Problems)
(page 6)
6 XXXIII Brazilian Math Olympiad 2011
Problem 4
Do there exist 2011 positive integers a
1
< a
2
< . . . < a
2011
such that
gcd(a
i
, a
j
) = a
j
a
i
for any i, j such that 1 i < j 2011?
Problem 5
Let ABC be an acute triangle and H is orthocenter. Let D be the inter-
section of BH and AC and E be the intersection of CH and AB. The
circumcircle of ADE meets the circumcircle of ABC at F = A. Prove that
the angle bisectors of

BFC and

BHC concur at a point on line BC.
Problem 6
Let a
1
, a
2
, . . . , a
2011
be nonnegative reals with sum
2011
2
. Prove that

cyc
(a
n
a
n+1
)

= |(a
1
a
2
)(a
2
a
3
) . . . (a
2011
a
1
)|
3

3
16
.
2.4. Undergraduates
Problem 1
For each real number t, let P
t
(x) = x
3
12x +t and let
(t) = max{c R | P
t
(c) = 0} min{c R | P
t
(c) = 0}
the dierence between the largest and the smallest real roots of P
t
(x). De-
termine the range of values that (t) can assume as t varies.
Problem 2
Consider a regular n-gon inscribed in the unit circle. Compute the sum of
the areas of all triangles determined by the vertices of the n-gon.
Problem 3
Let n be a positive integer and A a subset of Z/(n), the set of the integers
modulo n, dene f(A) = min
tZ/(n)
|A (A+t)|, where A+t = {x +t, x
A} Z/(n). Dene g(n) = max{f(A); A Z/(n), |A| = n/2}.
(a) Prove that g(n) n/4 1, n 1.
(b) Prove that g(n) = n/4 1 for innite values of n 1.
Problem 4
Consider the polynomial f(x) = x
3
+x
2
4x + 1.
6
(Problems)
(page 7)
Problems 7
(a) Prove that if r is a root of f(x) then r
2
+r 3 is also a root of f(x).
(b) Let , , be the three roots of f(x), in some order. Determine all
possible values of

Problem 5
If u
1
, . . . , u
k
R
3
, denote by C(u
1
, . . . , u
k
) the cone generated by u
1
, . . . , u
k
:
C(u
1
, . . . , u
k
) = {a
1
u
1
+ +a
k
u
k
; a
1
, . . . , a
k
[0, +)}.
Let v
1
, v
2
, v
3
, v
4
points randomly and independently chosen from the unit
sphere x
2
+y
2
+z
2
= 1.
(a) What is the probability that C(v
1
, v
2
, v
3
, v
4
) = R
3
?
(b) What is the probability that each of the vectors is needed to generate
C(v
1
, v
2
, v
3
, v
4
), i.e., that C(v
1
, v
2
, v
3
) = C(v
1
, v
2
, v
3
, v
4
), C(v
1
, v
2
, v
4
)
= C(v
1
, v
2
, v
3
, v
4
), C(v
1
, v
3
, v
4
) = C(v
1
, v
2
, v
3
, v
4
) and C(v
2
, v
3
, v
4
) =
C(v
1
, v
2
, v
3
, v
4
)?
Problem 6
Let (x
n
)
n0
be a sequence of integer numbers that fullls a linear recursion of
order k for a xed positive integer k, i.e., there exists real constant numbers
c
1
, c
2
, . . . , c
k
such that x
n+k
=

k
r=1
c
r
x
n+kr
, n 0. Suppose k is the
minimum positive integer with this property. Prove that c
j
Z, for all j,
1 j k.
7
(Problems)
(page 8)
(Problems)
(page 9)
9 Solutions
3.1. Grades 67
Problem 1
(a) The erased numbers were 2 = 2 1, 4 = 2 2, . . ., 2010 = 2 1005. So
2011 1005 = 1006 numbers were left on the board.
(b) We can list the numbers: they are 1, 11, 101, 111, 1001, 1011, 1101,
1111, a total of 8.
OR we can argue that the number is of the form (abc1), where a, b, c are
digits equal to either 0 or 1. Notice that the units digit must be 1.
Problem 2
The bigger cube has sidelength
12
5
cm, so the dierence between the side-
lengths is
12
5
2 =
2
5
cm, that is, the red cubes should not have sidelength
greater than this length. Cubes with sidelength
2
5
cm are the natural can-
didates, so we set a new unit u =
2
5
cm. Notice that the bigger cube should
have sidelength 6 u and the original cube must have sidelength 5 u. So we
need 6
3
5
3
= 91 red cubes.
Problem 3
(a) First notice that 86 is pal. Then its not hard to check by hand that
every number from 87 to 99 is not pal.
(b) The answer is yes. First consider the 2011-digit number 11 . . . 1
. .
2011 ves
. The
sum of its digits is 2011. The smallest perfect square greater than 2011
is 45
2
= 2025. Since 2025 2011 = 14 and 14 = 2 (2
2
1
2
) +(3
2
1
2
),
we can exchange two 1s by two 2s and one 1 by one 3. So we obtain
the pal number 11 . . . 1
. .
2008 ves
223.
Problem 4
(a) The trapezoid OABC has area
AB+OC
2
OA =
4+2
2
2 = 6.
(b) Let A

, B

, C

and D

be the reections of A, B, C and D across O,

respectively. Because O is the center of the square, B

and D

lie on
the sides of the square. So the square is divided into four congruent
9
(Solutions)
(page 10)
10 XXXIII Brazilian Math Olympiad 2011
(non-convex) polygons, each with area
64
4
= 16. Then BCDE has area
16 6 = 10.
Problem 5
(a) For instance,
1 2 3
4 5 6
8 9 7
The trick is to only adjust the last row. The usual order 7, 8, 9 yields
all sums to be multiple of 3, so its just a matter of rearranging them.
(b) No, its not possible. First, notice that the sum of three numbers x, y, z
is a multiple of 3 i x y z (mod 3) or x, y, z are 0, 1, 2 mod 3
in some order. Let a, b, c, d be the numbers in the corner modulo 3. So
two of them are equal. We can suppose wlog that they are either a = b
or a = d. Also, let x be the number in the central cell modulo 3.
a
b
x
c
d
If a = d, then x = a and x is equal to either b or c. Suppose wlog x = b = a.
Then we have the following situation:
a
b
b
c a
10
(Solutions)
(page 11)
Solutions 11
Let m be the other remainder (that is, m = a and m = b). Then m cannot
be in the same line as a and b. This leaves only one possibility:
a
b
m
b
m m a
But the remaining a will necessarily yield a line with all three remainders.
Now if a = b, then both c and d are dierent from a (otherwise, we reduce
the problem to the previous case). If d = c, a, c, d are the three distinct
remainders, and we have no possibility for x. So c = d.
a a
x
c c
But this prevents the other remainder m to appear in the middle row,
leaving only two cells for three numbers, which is not possible.
So, in both cases, one of the sums is a multiple of 3.
3.2. Grades 89
Problem 1
See problem 5.b, grades 67.
Problem 2
Since AD = CD, AB = AC and

ADC =

BAC, triangles ADC and
BAC are similar by case SAS. Segments CM and CN are corresponding
medians, so
CM
CN
=
CA
CB
and

BCN =

ACM

BCN +

NCA =

ACM +

NCA

BCA =

NCM. Thus, again by case SAS,
triangles CMN and CAB are similar, and therefore CMN is an isosceles
triangle with CM = MN.
11
(Solutions)
(page 12)
12 XXXIII Brazilian Math Olympiad 2011
Problem 3
She can obtain the product of any two numbers a and b by asking gcd(a, b)
and lcm(a, b), since lcm(a, b) gcd(a, b) = ab. The identity
abc =
lcm(a, b) lcm(a, c) lcm(b, c) gcd(a, b, c)
lcm(a, b, c)
essentially nishes the proof, since the 2011 numbers can be divided into a
set of three numbers and 1004 sets of two numbers.
It remains to prove the above identity. But this follows from the facts that
max(x, y)+max(x, z)+max(y, z)+min(x, y, z)max(x, y, z) = x+y+z, and
if p
x
i
a
i
then p
min{x
i
}
gcd(a
1
, a
2
, . . . , a
n
) and p
max{x
i
}
lcm(a
1
, a
2
, . . . , a
n
).
Problem 4
The smallest perfect square, apart from 1, is 2
2
= 4. So let a
1
, a
2
, . . . , a
k
be
the numbers on the list modulo 4. We cannot have a
i
= 0; also, there is at
most one a
i
equal to 2 and we cannot have a
i
= 1 and a
j
= 3 simultaneously.
We claim that among any four distinct numbers a
1
, a
2
, a
3
, a
4
fullling the
above properties there are three of them whose sum is a multiple of 4.
Indeed, there are two equal numbers, say a
1
, a
2
. We cannot have a
1
= a
2
=
2, so either a
1
= a
2
= 1 or a
1
= a
2
= 3. We can suppose wlog a
1
= a
2
= 1
(otherwise, reverse the signs of all four numbers modulo 4). But since we
also cannot have a
j
= 3 and a
3
= a
4
= 1, one of a
3
, a
4
, say a
3
, is 2. But
then a
1
+a
2
+a
3
= 1 + 1 + 2 = 4.
So the quantity of numbers is at most 3. 5, 13 and 17 is an example of a
list with three numbers.
Problem 5
Since
_
16
2

3
_
2
=
64
3
= 21+
1
3
lies between 4.5
2
= 20.25 and 5
2
and the altitude
of the triangle is
2

3
2
= 3, we can cover an square with sidelength 16 with
2 5
_
16
3
_
= 60 equilateral triangles. Since
_
1000
60
_
= 16, by the pigeon hole
principle there is an equilateral triangle that covers at least 17 points.
Problem 6
We will prove by induction that odd(N) even(N) < N for all positive
integers N with 2k digits. If N = 10a + b, a, b {0, 1, 2, . . . , 9}, a = 0,
N = 10a +b > a b +b a b = even(N) odd(N).
Now suppose that N has 2k > 2 digits and that the claim is true for all
numbers with 2k 2 digits. Let c and d be the two leftmost digits of N,
12
(Solutions)
(page 13)
Solutions 13
so that N = c 10
2k1
+ d 10
2k2
+ N
0
, N
0
with 2k 2 digits. Then
odd(N) = d 10
k1
+ odd(N
0
) and even(N) = c 10
k1
+ even(N
0
). So we
need to prove that
c 10
2k1
+d 10
2k2
+N
0
>(c 10
k1
+even(N
0
)) (d 10
k1
+odd(N
0
))
c 10
2k1
+d 10
2k2
+N
0
>
cd 10
2k2
+d 10
k1
even(N
0
)+c 10
k1
odd(N
0
)+odd(N
0
) even(N
0
)
But this is true, since both odd(N
0
) and even(N
0
) are less than 10
k1
and
thus
c 10
2k1
c(d + 1) 10
2k2
> cd 10
2k2
+c 10
k1
odd(N
0
)
d 10
2k2
> d 10
k1
even(N
0
)
N
0
> odd(N
0
) even(N
0
)
3.3. Grades 1012
Problem 1
Consider the number 55 . . . 5
. .
n times
. The sum of the squares of its digits is n 5
2
=
25n. We can exchange any two ves by one three and one four, so the sum
of the squares decreases by 5
2
, until we run out of ves. So we can get any
sum from 25 n/2 and 25 n. So it suces to show that there is an integer
k such that
n
2
k
2
n. Choose k such that k
2
n < (k + 1)
2
. Suppose
k
2
<
n
2
. Then n > 2k
2
, and (k +1)
2
> n > 2k
2
= (k +1)
2
2k
2
+2
k
2
2k + 1 0 (k 1)
2
0, which is false except for k = 1, or
2 < n < 4, that is, n = 3. But the statement of the problem itself gives an
example with n digits: 122.
Problem 2
Number the stickers from 1 to 2011 and let S
i
be the set of the stickers that
the friend i has, 1 i 33.
Since 2011 = 33612, consider the example where S
i
= {k Z | 61(i1) <
k 61i} for i = 1, 2, . . . , 31, S
32
= {k Z | 61 31 < k < 61 32} and
S
33
= {k Z | 61 32 k 2011}.
Notice that |S
i
| = 61 for 1 i 31 and |S
i
| = 60 for i = 32 and i = 33.
Thus |S
i
S
j
| 2 61, and therefore m > 2011 2 61 = 1889.
13
(Solutions)
(page 14)
14 XXXIII Brazilian Math Olympiad 2011
Now we prove that the minimum value of m is, in fact, m = 1890. First,
notice that if m = 1890 then |S
i
S
j
| 2011 1890 = 121. Suppose that
|S
1
S
2
S
3
| > 181. Then one of the sets, say S
1
, has more than 181/3
elements, that is, |S
1
| 61. But |(S
1
S
2
S
3
) \(S
1
S
2
)| > 181121
|S
3
\(S
1
S
2
)| > 60. But |S
3
S
1
| = |S
3
\S
1
| +|S
1
| |S
3
\(S
1
S
2
)| +|S
1
| >
60 + 61 = 121, contradiction. Hence |S
1
S
2
S
3
| 181.
So, |S
1
S
2
. . .S
33
| |S
1
S
2
S
3
|+|S
4
S
5
|+|S
6
S
7
|+ +|S
32
+S
33
|
181 + 15 121 = 1996, and there exists sixteen stickers that none of the 33
friends have.
Another solution: We will prove that m = 1890 in another way. The
example for m = 1889 is the same from the previous solution.
Again, number the stickers from 1 to 2011 and let T
i
be the set of the stickers
that the friend i does not have, 1 i 33.
Consider all pairs (x, {i, j}) such that x T
i
T
j
. If for every sticker there
is a friend that has it, that is, T
1
T
2
. . . T
33
= then for each x there
exists k such that x / T
k
. So each x belongs to at most 32 sets T
i
and,
hence, there exist at most 2010
_
32
2
_
pairs (x, {i, j}). On the other hand,
since |T
i
T
j
| m there exists at least m
_
33
2
_
pairs (x, {i, j}). Therefore,
if T
1
T
2
. . . T
33
= then
m
_
33
2
_
2011
_
32
2
_
m 1890
Thus, if m 1819 there exists an element x that is contained in all sets T
i
.
Remark: One can prove in a similar fashion that if the sticker album has
n stickers and there are k friends, the minimum value of m is
_

_
n 1 if k n
n 2
_
n
k
_
+ 1 if k < n and k | n
n 2
_
n
k
_
if k < n and n mod k = 1
n 2
_
n
k
_
1 if k < n and n mod k > 1
Problem 3
Lets prove that there exists a triangle P
j
P
j+1
P
j+2
with area less than or
equal to =
5

5
2
. Suppose that all triangles P
j
P
j+1
P
j+2
have area greater
14
(Solutions)
(page 15)
Solutions 15
than .
Let diagonals P
1
P
4
and P
3
P
5
meet at Q. Since Q P
3
P
5
, area P
1
P
2
Q
max(area P
1
P
2
P
5
, area P
1
P
2
P
3
) < , so area P
1
P
2
P
4
= 1 area P
1
P
4
P
5

area P
2
P
3
P
4
> 1 2. Thus
P
1
Q
P
1
P
4
=
area P
1
P
2
Q
area P
1
P
2
P
4
<

1 2
We also have
P
1
Q
P
4
Q
=
area P
1
P
3
P
5
area P
3
P
4
P
5
. Since area P
3
P
4
P
5
< and area P
1
P
3
P
5
>
1 2,
P
1
Q
P
4
Q
>
1 2

P
1
Q
P
1
P
4
>
1 2
1
Therefore
12
1
<
P
1
Q
P
1
P
4
<

12
= 5
2
5+1 <0
5

5
10
< <
5+

5
10
,
contradiction.
The proof of the other inequality is analogous.
Problem 4
The answer is yes and you can construct an example in several ways. The
main observation is that gcd(a
i
, a
j
) = a
j
a
i
a
j
a
i
| a
i
. In fact,
if gcd(a
i
, a
j
) = a
j
a
i
then a
j
a
i
| a
i
and, conversely, if a
j
a
i
| a
i
then a
j
a
i
| a
i
+ (a
j
a
i
) a
j
a
i
| a
j
, so a
j
a
i
| gcd(a
i
, a
j
).
But gcd(a
i
, a
j
) | a
i
and gcd(a
i
, a
j
) | a
j
implies gcd(a
i
, a
j
) | a
j
a
i
, so
gcd(a
i
, a
j
) = a
j
a
i
.
Once this fact is established, one can construct the sequence inductively as
follows: rst consider the two-term sequence (1, 2). Now, given a sequence
15
(Solutions)
(page 16)
16 XXXIII Brazilian Math Olympiad 2011
(x
1
, x
2
, . . . , x
k1
) with k 1 terms such that gcd(x
i
, x
j
) = x
j
x
i
, construct
a new sequence adding x
0
to every term and putting x
0
at its beginning:
(x
0
, x
1
+x
0
, x
2
+x
0
, . . . , x
k1
+x
0
). All we need to do is to nd x
0
. By the
previous observation, we need x
j
x
i
| x
i
+x
0
and x
i
| x
0
. We already have
that x
j
x
i
| x
i
, so a good choice is x
0
= lcm(x
1
, x
2
, . . . , x
k1
), because
by denition x
i
| x
0
and, since x
i
| x
0
and x
j
x
i
| x
i
, x
j
x
i
| x
0
, so
x
j
x
i
| x
i
+x
0
. So we obtained a new sequence with k terms and the result
follows by induction.
Problem 5
By the angle bisector theorem, it suces to prove that
BF
FC
=
BH
HC
.
We have

EFB = 180

FEA = 180

FDA =

FDC and

FBE =

FBA =

FCA =

FCD, so triangles BEF and CDF are similar. Thus
BF
FC
=
BE
CD
=
BH cos

EBH
CH cos

DCH
=
BH cos(90

BAC)
CH cos(90

BAC)
=
BH
CH
and the result follows.
Problem 6
In what follows, indices are taken modulo 2011 and E =

cyc
(a
n
a
n+1
)

.
Lemma. If E is maximum, for every i {1, 2, . . . , 2011}, one of the num-
bers a
i1
, a
i
, a
i+1
is zero.
Proof. Suppose, by means of contradiction, that E is maximum and there
exists a
i
such that a
i1
, a
i
, a
i+1
are all nonzero (that is, a
i1
a
i
a
i+1
> 0).
Dene A = {a
i
| a
i
> 0} and B = {a
i
| a
i1
a
i
a
i+1
> 0}. Then B A and
16
(Solutions)
(page 17)
Solutions 17
B = . Let a
k
= min B and consider a
k1
and a
k+1
. We have the following
cases:
a
k
< a
k1
and a
k
< a
k+1
. Let
a

i
=
_
0, if a
i
= 0 or i = k
a
i
+
a
k
|A|1
, if a
i
> 0 and i = k
That is, we make a
k
be zero and distribute it among the remaining nonzero
terms. So |a
i
a
i+1
| remains unchanged if a
i
, a
i+1
A and k / {i, i +1}, or
a
i
, a
i+1
/ A; increases from |a
i
a
i+1
| = max{a
i
, a
i+1
} to max{a
i
, a
i+1
} +
a
k
|A|1
if a
i
/ A or a
i+1
/ A, but not both; increases from |a
k1
a
k
| =
a
k1
a
k
to a
k1
+
a
k
|A|1
if k {i, i + 1}.
a
k1
< a
k
< a
k+1
. This means that a
k1
/ B, and a
k
B, a
k1
>
0, that is, a
k1
A \ B, which means a
k2
= 0. In this case, we
enchange (a
k1
, a
k
) for (a

k1
, a

k
) = (a
k1
+ a
k
, 0). Then |a
i
a
i+1
|
remains unchanged for i / {k 2, k 1, k}; for i = k 2 increases
from |a
k2
a
k1
| = a
k1
to |a
k2
a

k1
| = a
k1
+ a
k
; for i = k 1
increases from |a
k1
a
k
| = a
k
a
k1
to |a

k1
a

k
| = a
k1
+ a
k
; for
i = k increases from |a
k
a
k+1
| = a
k+1
a
k
to |a

k
a
k+1
| = a
k+1
.
a
k1
> a
k
> a
k+1
. Analogous to the previous case.
a
k
> a
k1
and a
k
> a
k+1
. This means a
k1
, a
k+1
A\B, that is, a
k2
=
a
k+2
= 0. In this case, exchange (a
k1
, a
k
, a
k+1
) for (a

k1
, a

k
, a

k+1
) =
(a
k1
+ a
k
/2, 0, a
k+1
+ a
k
/2). All dierences |a
i
a
i+1
| remain un-
changed except if i {k 2, k 1, k, k + 1}. The only change is
|(a
k2
a
k1
)(a
k1
a
k
)(a
k
a
k+1
)(a
k+1
a
k+2
)| = a
k1
(a
k
a
k1
)(a
k

a
k+1
)a
k+1
to |(a
k2
a

k1
)(a

k1
a

k
)(a

k
a

k+1
)(a

k+1
a
k+2
)| = (a
k1
+
a
k
/2)
2
(a
k+1
+a
k
/2)
2
. But
(a
k1
+a
k
/2)
2
(a
k+1
+a
k
/2)
2
= (a
k1
(a
k1
+a
k
) +a
2
k
/4)(a
k+1
(a
k+1
+a
k
) +a
2
k
/4)
> a
k1
(a
k
+a
k1
)(a
k
+a
k+1
)a
k+1
> a
k1
(a
k
a
k1
)(a
k
a
k+1
)a
k+1
Since we covered all cases, the lemma holds.
Now we only have groups with one or two consecutive nonzero variables.
For a group (0, a
k
, 0), we obtain the product |(a
k1
a
k
)(a
k
a
k+1
)| = a
2
k
;
for a group (0, a
k
, a
k+1
, 0), the obtain |(a
k1
a
k
)(a
k
a
k+1
)(a
k+1
a
k+2
)| =
a
k
a
k+1
|a
k+1
a
k
|. Notice that the groups can be interchanged, such that we
can suppose wlog that all groups with two nonzero variables are contiguous.
17
(Solutions)
(page 18)
18 XXXIII Brazilian Math Olympiad 2011
Lemma. If E is maximum then there is exactly one group with two nonzero
variables.
Suppose, that there are at least two groups of nonzero variables (0, a, b, 0)
and (0, c, d, 0). By the above remark, we can suppose wlog that the groups
are consecutive, that is, its (0, a, b, 0, c, d, 0). Exchange these variables for
(0, a + b/2, 0, (b + c)/2, 0, d + c/2, 0). The product abcd|(a b)(c d)| is
exchanged for (a + b/2)
2
((b + c)/2)
2
(d + c/2)
2
. But we already know that
(a+b/2)
2
> a|ab|, (d+c/2)
2
> d|cd| and, by AMGM, ((b+c)/2)
2
bc.
Multiplying everything yields the lemma.
Combining the two lemmas, we can suppose wlog that the nonzero variables
are the ones with odd indices, that is, a
1
, a
3
, . . . , a
2011
. In this case, we obtain
the product a
1
a
2011
|a
1
a
2011
|a
2
3
a
2
5
. . . a
2
2009
, and we can optimizer it locally.
Let a
1
+ a
2011
= s and suppose wlog a
1
> a
2011
. Let , be positive real
numbers to be determined. By AMGM,
a
1
a
2011
(a
1
a
2011
) =
1

(a
1
)(a
2011
)(a
1
a
2011
)

_
a
1
+a
2011
+ (a
1
a
2011
)
3
_
3
=
1

_
( + 1)a
1
+ ( 1)a
2011
3
_
3
So we choose and such that
we obtain s in the end, that is, + 1 = 1 = 2;
the equality can occur, that is, a
1
= a
2011
= a
1
a
2011
a
2011
=
(1)a
1
and a
1
= (+1)a
2011
, that is, 1 = (1)(+1) =
= 2.
Thus and are the roots of the quadratic t
2
2t 2 = 0. Hence
=

3 1 and = 1 +

3, and
a
1
a
2011
(a
1
a
2011
)
1

_
( + 1)a
1
+ ( 1)a
2011
3
_
3
=
1
2
_

3(a
1
+a
2011
)
3
_
3
=

3
18
s
3
Now we optimize the rest. If a
3
+a
5
+ +a
2009
=
2011
2
s,
a
2
3
a
2
5
. . . a
2
2009

_
a
3
+a
5
+ +a
2009
1004
_
2008
=
_
2011
2
s
1004
_
2008
18
(Solutions)
(page 19)
Solutions 19
Now we nish the problem. Let be a positive real number to be deter-
mined.
E = a
1
a
2011
|a
1
a
2011
|a
2
3
a
2
5
. . . a
2
2009

3
18
s
3

_
2011
2
s
1004
_
2008
=

3
18
3
(s)
3
_
2011
2
s
1004
_
2008

3
18
3
_
3s + 2008
2011
2
s
1004
2011
_2011
=

3
18
3
_
2011 + (3 2)s
2011
_
2011
We choose = 2/3, so
a
1
a
2011
|a
1
a
2011
|a
2
3
a
2
5
. . . a
2
2009

3

3
16
Remark: The latter part of the problem can be solved with Calculus, but
we decided to give an elementary solution. Also, the equality occurs i
a
3
= a
5
= = a
2009
= 1, a
1
=
3+

3
4
and a
2011
=
3

3
4
or it is a cyclic
permutation (or we reverse the order of the variables).
3.4. Undergraduates
Problem 1
Let Q(x) = x
3
12x. Then Q

(x) = 3x
2
12 has roots 2 and 2, and
Q has a local minimum at (2, 16) and a local maximum at (2, 16). So
Q(x) = t has three (not necessarily distinct) real roots for 16 t 16
and one real root for t < 16 and t > 16, which means that (t) = 0 for
t < 16 or t > 16. So from now on we consider only t [16, 16]. Let
u v w be the roots. Since P

t
(x) = 0 x = 2 or x = 2 we have
u 2 v 2 w. In particular, 2 v 2, and v can assume any
value in this interval: if t = 16, v = 2 and if t = 16, v = 2.
But we know that u +v +w = 0 and uv +vw +uw = 12, so u +w = v
and uw = 12 v(u + w) = v
2
12, so ((t))
2
= (w u)
2
= (w + u)
2

4uw = 48 3v
2
, which lies in the range [48 3 2
2
, 48] = [36, 48]. So
36 ((t))
2
48 6 (t) 4

3.
So the range of (t) is {0} [6, 4

3].
19
(Solutions)
(page 20)
20 XXXIII Brazilian Math Olympiad 2011
Problem 2
First consider a triangle ABC and its circumcenter O. Then the area of
ABC is
R
2
2
(sin 2

A + sin 2

B + sin 2

C). Notice that if

B > 90

then
sin 2

B < 0.
So the sum is equal to the sum of the areas of triangles OA
i
A
j
with a
plus sign or a minus sign, depending on the third vertex A
k
of the triangle
A
i
A
j
A
k
: if A
k
lies on the major arc A
i
A
j
then we have a plus sign; else we
have a minus sign (it wont matter if A
i
A
j
is a diameter, because in that
case the area of OA
i
A
j
is zero).
Therefore, if A
i
A
j
subtend an minor arc of k
2
n
, 1 k n/2, the area
of the triangle OA
i
A
j
appears with a minus sign k 1 times and with a
plus sign n (k 1) 2 = n k 1 times. So it contributes with the sum
n k 1 (k 1) = n 2k times.
Considering that there are n arcs with length k
2
n
, if =
2
n
the required
sum is
S =
n
2
n/2

k=1
(n 2k) sin k =
n
2
2
n/2

k=1
sin k n
n/2

k=1
k sin k
Consider the sums S
1
() =

n/2
k=1
sin k and S
2
() =

n/2
k=1
cos k =
S

2
() =

n/2
k=1
k sin k. So we want to compute
n
2
2
S
1
() +n S

2
().
But
S
2
() +iS
1
()
=
n/2

k=1
cos k +i sin k =
n/2

k=1

k
=

n/2
1
1
=
n/2/2+1/2

n/2/2

n/2/2

1/2

1/2
=
_
cos
_
(n/2 + 1)
2
_
+i sin
_
(n/2 + 1)
2
__

sin(n/2/2)
sin(/2)
,
20
(Solutions)
(page 21)
Solutions 21
where = cos +i sin .
So
S
1
=
sin
_
(n/2+1)
2
_
sin
_
n/2
2
_
sin(/2)
=
cos(/2) cos((n/2 + 1/2))
2 sin(/2)
=
1
2
cot(/2)
cos((n/2 + 1/2))
2 sin(/2)
S
2
=
cos
_
(n/2+1)
2
_
sin
_
n/2
2
_
sin(/2)
=
sin(/2) + sin((n/2 + 1/2))
2 sin(/2)
=
1
2
+
sin((n/2 + 1/2))
2 sin(/2)
Finally,
S

2
()
=
__
n
2
_
+
1
2
_
cos
___
n
2
_
+
1
2
_

_
sin
_

2
_

1
2
cos
_

2
_
sin
___
n
2
_
+
1
2
_

_
2 sin
2
(/2)
=
n/2
2
cos((n/2 + 1/2))
sin(/2)

1
4
sin(n/2)
sin
2
(/2)
So the required sum is
n
2
2
_
1
2
cot(/2)
cos((n/2 + 1/2))
2 sin(/2)
_
+
n
_
n/2
2
cos((n/2 + 1/2))
sin(/2)

1
4
sin(n/2)
sin
2
(/2)
_
If n is even, n/2 = n/2 and substituting =
2
n
the sum simplies to
n
2
4
cot

n
If n is odd, n/2 = (n1)/2 and substituting =
2
n
the sum also simplies
to
n
2
4
cot

n
21
(Solutions)
(page 22)
22 XXXIII Brazilian Math Olympiad 2011
So the answer is
n
2
4
cot

n
Problem 3
(a) Let A = {a
1
, a
2
, . . . , a
n/2
}. Consider the sum
n1

t=0
|A (A+t)|
Now each element a A appears in a set A+t
i
|A| = n/2 times: choose
t
i
= a a
i
for each i = 1, 2, . . . , n/2. So
n1

t=0
|A (A+t)| =
__
n
2
__
2
and the average of |A (A+t)| is
1
n
__
n
2
__
2

n
4
.
Since |A (A + 0)| = |A| >
n
4
is above average, there is a t such that
|A (A+t)| is below average, so
f(A) |A (A+t)| <
n
4
= f(A)
_
n
4
_
1.
So g(n)
_
n
4
_
1.
(b) Let p 3 (mod 4) ne a prime, and set
A = (F

p
)
2
(non-zero quadratic residues modulo p)
We have to show that
|(A+t) A|
_
p
4
_
1 for all t F
p
Since this is clear for t = 0, we henceforth assum that t = 0. From now on,
all equalities are in F
p
, that is, taken modulo p.
22
(Solutions)
(page 23)
Solutions 23
We have that x
2
A (A+t) if and only if there exists y
2
A such that
x
2
= y
2
+t (x y)(x +y) = t

x y = u
x +y = u
1
t
for some u F

x =
u +u
1
t
2
y =
u
1
t u
2
for some u F

p
Therefore |A (A+t)| equals the number of elements of F
p
of the form
x
2
=
u
2
+ 2t +u
2
t
2
4
, u F

p
,
with x = 0 and y = 0, that is,

u +u
1
t = 0
u
1
t u = 0
u
2
= t
Notice that since p 3 (mod 4)
_
t
p
_
=
_
1
p
__
t
p
_
=
_
t
p
_
and therfore there is exactly one quadratic residue in {t, t}.
On the other hand, it u
2
= v
2
,
u
2
+ 2t +u
2
t
2
4
=
v
2
+ 2t +v
2
t
2
4
u
2
v
2
=
t
2
u
2

t
2
v
2
u
2
v
2
= t
2
Hence, as u
2
runs over the non-zero quadratic residues, with exception of
t, we obtain each x
2
A (A+t) twice (observe that the case u
2
= v
2
is
excluded since u
2
u
2
= t
2
u
2
= t). Therefore
|A (A+t)| =
p1
2
1
2
=
p 3
4
=
_
p
4
_
1,
as required.
23
(Solutions)
(page 24)
24 XXXIII Brazilian Math Olympiad 2011
Problem 4
(a) First notice that, since r is a root, then r
3
+ r
2
4r + 1 = 0
r
2
+r 3 = 1
1
r
. So we need to prove that
_
1
1
r
_
3
+
_
1
1
r
_
2
4
_
1
1
r
_
+ 1 = 0
1
3
r
+
3
r
2

1
r
3
+ 1
2
r
+
1
r
2
4 +
4
r
+ 1 = 0
1
1
r
+
4
r
2

1
r
3
= 0
r
3
+r
2
4r + 1 = 0,
which is true.
(b) Iterating 1
1
r
, we get 1
1
1
1
r
=
1
1r
. Its not hard to see that r, 1
1
r
=
r1
r
and
1
1r
are all distinct. In fact, if r = 1
1
r
then r
2
r + 1 = 0,
and r
3
= 1, so r
2
4r = 0, which is not true.
So there are two possible ways of computing

:
(, , ) =
_
r,
r1
r
,
1
1r
_
:

=
r
2
r 1

(r 1)
2
r

1
r(r 1)
=
r
3
(r 1)
3
1
r(r 1)
=
3r(r 1)
r(r 1)
= 3
(, , ) =
_
r,
1
1r
,
r1
r
_
:

= r(r 1)
r
(r 1)
2
+
r 1
r
2
=
r
6
+ 3r
5
3r
4
+r
3
3r
2
+ 3r 1
r
4
2r
3
+r
2
Since r
6
+3r
5
3r
4
+r
3
3r
2
+3r 1 = (r
3
+r
2
4r +1) (r
3
+4r
2

11r + 29) 80r

2
+ 130r 30 = 80r
2
+ 130r 30 and r
4
2r
3
+ r
2
=
(r
3
+r
2
4r 1) (r 3) + 8r
2
13r + 3 = 8r
2
13r + 3. So

=
80r
2
+ 130r 30
8r
2
13r + 3
= 10.
24
(Solutions)
(page 25)
Solutions 25
Another way to solve this problem is realizing that if (, , ) =
_
r,
r1
r
,
1
1r
_
then the other sum is actually

. By Vietas formula,
1
= ++ =
1,
2
= + + = 4 and
3
= = 1.

=

2
+
2
+
2
+
2
+
2
+
2

=

1

2
3
3

3
=
(1) (4) 3(1)
1
= 7,
so

= 7 3 = 10.
Problem 5
(a) The probability that the cone of the four vectors is proper is
7
8
so the
probability that the cone is all of R
3
is
1
8
.
Construct a vector u
12
that is normal to the plane spanned by v
1
and v
2
oriented so that v
3
u
12
> 0. Then the half-space {w | w u
12
0} contains
the cone generated by {v
1
, v
2
, v
3
}. It follows that if v
4
u
12
> 0, the cone
generated by all four vectors will be contained in the same half-space. So
to keep the cone from being proper, we must assume that u
4
u
12
< 0.
Similarly, nd u
13
orthogonal to v
1
and v
3
with v
2
u
13
> 0 and u
23
orthogonal
to v
2
and v
3
with v
1
u
13
> 0. The cone is proper contained in a half space
if and only if at least one of the three values v
4
u
ij
> 0. I further claim
that if all three of those dot products are negative, then the cone covers all
of space.
If v
1
, v
2
and v
3
are xed, the three signs of the dot products v
4
u
ij
are
not independent. But if we average over all choices of the vectors, then v
1
occurs exactly as often as +v
1
and so on. We conclude that on average the
three dot products in question are negative with probability
1
8
.
(b) Given v
1
, v
2
and v
3
then v
4
lies in the interior of the cone generated by
those three if and only if v
4
u
ij
> 0 for all three such dot products.
So there is a
1
8
chance that v
4
lies in C(v
1
, v
2
, v
3
). Similarly, there is
a
1
8
chance that v
2
lies in C(v
1
, v
3
, v
4
). These two events are disjoint:
only one vector can be in the interior of a triangle of the other three.
So the probability we seek is the union of four disjoint events, each of
probability
1
8
, which gives a probability of
1
2
.
25
(Solutions)
(page 26)
26 XXXIII Brazilian Math Olympiad 2011
Problem 6
Let (a
(i)
n
) be the sequence of integers obtained by shifting a
n
by i positions,
i.e., a
(i)
n
= a
n+i
. Then
(a
(0)
n
), (a
(1)
n
), . . . , (a
(k)
n
)
is a basis for the k-dimensional C-vector space of sequences (b
n
) satisfying
b
n+k
= c
k1
b
n+k1
+ +c
0
b
n
(n 0) ()
In fact, any non-trivial C-linear relation among (a
(0)
n
), . . ., (a
(k1)
n
) would
imply that k is not minimal.
Now let
f(x) = x
k
c
k1
x
k1
c
0
and

1
, . . . ,
k
be the roots of f(x) (listed with multiplicity). First, observe that all co-
ecients c
i
are rational since they are solutions to the linear system with
integer coecients
_
_
_
_
a
0
a
1
. . . a
k1
a
1
a
2
. . . a
k
.
.
.
.
.
.
.
.
.
.
.
.
a
k1
a
k
. . . a
2k2
_
_
_
_
_
_
_
_
c
0
c
1
.
.
.
c
k1
_
_
_
_
=
_
_
_
_
a
k
a
k+1
.
.
.
a
2k1
_
_
_
_
(the matrix is non-singular since the (a
(i)
n
)s are linear independent.) There-
fore the
i
s are algebraic numbers.
Dene
t
n
=
n
1
+
n
2
+ +
n
k
(n 0)
Then all t
n
Q (they are symmetric expression on the roots of f(x) Q[x])
and the t
n
satisfy (), hence there are r
i
such that
t
n
= r
0
a
(0)
n
+r
1
a
(1)
n
+ +r
k1
a
(k1)
n
Clearly r
i
Q since t
n
, a
(i)
n
Q for all n.
To sum up, if d > 0 is an integer such that dr
i
Z, i = 0, 1, . . . , k 1, then
dt
n
Z
26
(Solutions)
(page 27)
Solutions 27
for all n. Next, we show that this implies that the
i
are algebraic integers,
which in turn implies that all the c
i
are integers, nishing the problem.
By Newtons identities, we may write the elementary symmetric polynomials
in
n
as polynomials with rational coecients of
t
n
=
n
1
+ +
n
k
t
2n
=
2n
1
+ +
2n
k
.
.
.
t
kn
=
kn
1
+ +
kn
k
Therefore the minimal polynomials of
n
i
over Q have coecients with
bounded denominators, independent of n (they depend only on d and k).
Hence there exists an integer > 0 such that
n
i
are algebraic integers
for all n. But that implies that the ring Z[
i
] is contained in the nitely
generated Z-module
1

O
Q(
i
)
, where O
Q(
i
)
is the ring of algebraic integers
in the eld Q(
i
). Therefore Z[
i
] itself is nitely generated as a Z-module
(use the fact that Z is noetherian or that O
Q(
i
)
is a free Z-module, together
with the structure theorem of nitely generated modules over a PID). Hence

i
is an algebraic integer, as required.
Alternatively, suppose that
i
is not an algebraic integer, so that it has
prime ideal factorization
(
i
) = p
e
i
1
. . . p
e
s
s
with e
i
< 0 for some i, say e
1
.
Then
(
n
i
) = () p
ne
1
1
. . . p
ne
s
s
would have a negative p
1
-exponent for n suciently large, contradicting the
fact that
n
i
is an algebraic integer for all n 0.
27
(Solutions)
(page 28)
(Solutions)
(page 29)
29 Winners in 2011
4.1. Grades 67
Gold medals
Pedro Henrique Sacramento de Oliveira
Rogerio Aristida Guimaraes Junior
Mateus Siqueira Thimoteo
William Hideki Kondo
Bruna Malvar Castello Branco
Nathan Bonetti Teodoro
Silver medals
Mariana Miwa Okuma Miyashiro
Lucas dos Anjos Dantas Teixeira
Maria J ulia Costa Medeiros
Mateus Pereira
Carolina Carvalho Silva
Laura Mello DUrso Vianna
Henrique Gontijo Chiari
Nicolas Wolaniuk do Amaral Carvalho
Lucas Diniz Gon calves Villas Boas
Bronze medals
Leonardo de Matos Fellippetti Mariano
L ucia Ver onica Copque Aguiar de Souza
Adriana Mayumi Shiguihara
Daniel Akira Hasimoto
Rodrigo Gon calves Correa
Cesar Ricardo Silva Filippi
Marina Maciel Ansanelli
Henrique Bittencourt Netto Monteiro
Julia Perdig ao Saltiel
Jonathan Pereira Maria
Lucas Tokio Kawahara
Sandra Ayumi Nihama
Joao Guilherme Madeira Ara ujo
Andrey Jhen Shan Chen
29
(Winners in 2011)
(page 30)
30 XXXIII Brazilian Math Olympiad 2011
Bruno Brasil Meinhart
Daniel Quint ao de Moraes
Diene Xie
Honorable mention
Felipe Reyel Feitosa
Henrique Corato Zanarella
Alcia Fortes Machado
Andre Yuji Hisatsuga
Bernardo Puetter Schaeer
Bruno Teixeira Gomes
Eduardo Reis Cavalcante de Farias
Bruno Vinicius da Silva Alves
Adriano Henrique de C. A. e Silva
Fernando Seiji B. dos Santos
Alba Clara Vasconcelos Leopoldo Feitosa
Bruno Kenzo Ozaki
Eduardo Lennert Ramme
Iara Rohn Kombrink Davies
Victor Alves Benevides
Samuel Sena Galvao
Vitor Thomaz da Cruz
Francisco Bruno Dias Ribeira da Silva
Bryan Diniz Borck
Jonathan Aires Pinheiro
Nicolas Meira Sinott Lopes
Rafael Tchen Yin Hang Wei
Joao Alberto Moreira Serodio
Loc Dominguez
Vincius Soares de Abreu Silva
Breno Maia Baptista
Lusa H oller Lee
Brendon Diniz Borck
Eduardo Emilio Costa Trunci
Bernardo Gabriele Collaco
Lucas Hideki Takeuchi Okamura
Plinio Melo Guimaraes Valerio
Rodrigo Vieira Casanova Monteiro
Victor M. K. Tsuda
30
(Winners in 2011)
(page 31)
Winners in 2011 31
Arthur Henrique Craveiro Costa
Pedro Orii Antonacio
Gabriel Moura Bra una
Vict oria Santos Duarte Ramos

Italo Rennan Lima

Amanda Barbosa Schirmbeck
Thiago Ferreira Teixeira
Gabriel Dante Cawamura Seppelfelt
Lucas Siqueira Aragao
Milena Delarete Drummond Marques
Rodrigo Moutinho Faria
Daniel Lopes de Castro
Joao Vitor Vaz Oliveira
Matheus Bevilacqua
4.2. Grades 89
Gold medals
Alessandro A. P. de Oliveira Pacanowski
Gabriel Fazoli Domingos
Daniel Santana Rocha
Vitor Dias Gomes Barrios Marin
Luze Mello DUrso Vianna
Silver medals
Daniel Lima Braga
Fabio da Silva Soares
Joao Pedro Sedeu Godoi
Murilo Corato Zanarella
Bruno Eidi Nishimoto
Mariana Teatini Ribeiro
Samuel Brasil de Albuquerque
Lucas Mioranci
Mateus Bezrutchka
Ana Karoline Borges Carneiro
Ana Emlia Hernandes Dib
Bronze medals
Pedro Henrique Alencar Costa
31
(Winners in 2011)
(page 32)
32 XXXIII Brazilian Math Olympiad 2011
Pedro Augusto Brasileiro Lins Barbosa
Gabriel Mayrink Verdun
Leonardo Santos Matiello
Matheus Cari us Castro
Lucca Morais de Arruda Siaudzionis
Luiz Cl audio Sampaio Ramos
Matheus Carioca Sampaio
Jose Wanderclesson Nobre Damasceno Filho
Suzane Eberhart Ribeiro da Silva
Estevao Waldow
Erika Rizzo Aquino
Pedro Jorge Luz Alves Cronemberger
Alexandre Mendon ca Cardoso
Ricardo Ken Wang Tsuzuki
Honorable mention
Leonardo Alves Ramalho
Ana Paula Lopes Schuch
Fl avia Nakazato Hokama
Lucas Bastos Germano
Helena Veronique Rios
Isabelle Ferreira de Oliveira
Rafael Wilton Barboza Coracini
Eduardo Serpa
Giovana Sachett Maia
Paulo Henrique Omena de Freitas
Amanda Vidotto Cerqueira
Bruno Cicone de Almeida
Gabriel Picanco Costa
Guilherme Anitele Silva
Mateus Arraes Feitosa Borges
Rodrigo Zanette de Magalhaes
Luis Eduardo de Sousa Lima
Gabriel Vidigal de Paula Santos
Bruno Almeida Costa
Joao Baptista de Paula e Silva
Gabriel Ribeiro Barbosa
Kevin Eiji Inashita
Dimas Macedo de Albuquerque
32 (Winners in 2011)
(page 33)
Winners in 2011 33
Mauricio Najjar da Silveira
Juliano Petry Pesarico
Bruna Caroline Pimentel Gon calves
Gustavo Torres da Silva
Artur Corassa Martins
Italo Lesione de Paiva Rocha
Nathan Antonio de Azevedo Milagres
Juliana Amoedo Amoedo Pl acido
Vict oria Moreira Reis Cogo
Leandro Alves Cordeiro
Romulo Gabriel Lima da Costa
Bruno Vasconcelos Silva
Alexandro Vtor Seram de Carvalho
Cristhian Mafalda
Douglas Matos Gomes
Gabriel Diniz Vieira e Sousa
Enrico Pascucci Loel
Ricardo Vidal Mota Peixoto
4.3. Grades 1012
Gold medals
Joao Lucas Camelo Sa
Henrique Gasparini Fiuza do Nascimento
Rafael Kazuhiro Miyazaki
Andre Macieira Braga Costa
Rodrigo Sanches Angelo
Maria Clara Mendes Silva
Silver medals
Victor de Oliveira Bitaraes
Tadeu Pires de Matos Belfort Neto
Rafael Rodrigues Rocha de Melo
Gustavo Haddad Francisco e Sampaio Braga
Daniel Eiti Nishida Kawai
Henrique Vieira G. Vaz
Carlos Henrique de Andrade Silva
Victor Hugo Correa Rodrigues
Franco Matheus de Alencar Severo
33
(Winners in 2011)
(page 34)
34 XXXIII Brazilian Math Olympiad 2011
Gabriel Ilharco Magalhaes
Bronze medals
Lucas Louren co Hernandes
Ivan Tadeu Ferreira Antunes Filho
Kayo de Fran ca Gurgel
Michel Rozenberg Zelazny
Alexandre Perozim de Faveri
Davi Coelho Amorim
Marcos Massayuki Kawakami
Daniel dos Santos Bossle
Gabriel Militao Vinhas Lopes
Mateus Henrique Ramos de Souza
Victor Venturi
Ramon Silva de Lima
Gabriel Jose Moreira da Costa Silva
Otavio Augusto de Oliveira Mendes
Marcelo Luiz Gon calves
Honorable mention
Artur Dubeux Duarte
Natan Lima Viana
Bruno Silva Mucciaccia
Juliana Lemes Arai
Matheus Henrique Alves Moura
Felipe Sampaio Lima
Davi Sampaio de Alencar
Pedro Morais de Arruda Siaudzionis
Luiz Castelo Branco Cavalcante
Glauber de Lima Guarinello
Victor Oliveira Reis
Jose Ney Alves Feitosa Neto
Andre Bandeira Pinheiro
Fernando Lima Saraiva Filho
Rafael Tedeschi Eugenio Pontes Barone
Vincius Canto Costa
Lincoln de Queiroz Vieira
Thiago Poeiras Silva
Andre Amaral de Souza
34
(Winners in 2011)
(page 35)
Winners in 2011 35
Carlos Alexandre Silva dos Santos
Felipe Viana Sousa
Liara Guinsberg
Otavio Ara ujo de Aguiar
Rodolfo Rodrigues da Costa
Caque Porto Lira
Kelvin Azevedo Santos
Eric Tada de Souza
Marcelo Cargnelutti Rossato
Marina Pessoa Mota
4.4. Undergraduates
Gold medals
Renan Henrique Finder
Rafael Tupynamba Dutra
Regis Prado Barbosa
Guilherme Rodrigues Nogueira de Souza
Davi Lopes Alves de Medeiros
Silver medals
Gabriel Luis Mello Dalalio
Felipe Gon calves Assis
Darcy Gabriel Augusto de Camargo Cunha
Hugo Fonseca Ara ujo
Matheus Secco Torres da Silva
Erik Fernando de Amorim
Lucas Colucci Cavalcante de Souza
Bronze medals
Jose Leandro Pinheiro
Reinan Ribeiro Souza Santos
Daniel de Barros Soares
Rafael Endlich Pimentel
Carlos Henrique Melo Souza
Ivan Guilhon Mitoso Rocha
Thiago Ribeiro Ramos
Lucas de Freitas Smaira
Paulo Sergio de Castro Moreira
35
(Winners in 2011)
(page 36)
36 XXXIII Brazilian Math Olympiad 2011
Alexandre Azevedo Cesar
Ricardo Turolla Bortolotti
Roberio Soares Nunes
Marcelo Matheus Gauy
Charles Barbosa de Macedo Brito
Honorable mention
Renato Dias Costa
Felipe Vincent Yannik Romero Pereira
Rafael Alves da Ponte
Carlos Coelho Lechner
Joao Fernando Doriguello Diniz
Luiz Filipe Martins Ramos
Guilherme de Sena Brandine
Bruno de Nadai Sarnaglia
Iuri Rezende Souza
Pedro Veras Bezerra da Silva
Douglas Machado dos Santos
Leandro Farias Maia
Willy George do Amaral Petrenko
Cassio Henrique Vieira Morais
Michel Faleiros Martins
Jose Armando Barbosa Filho
Alysson Espndola de Sa Silveira
Fernando Nascimento Coelho
Gabriel Caser Brito
Fernando Fonseca Andrade Oliveira
Breno Vieira de Aguiar
Thales Gra ca Athanasio
Tiago Fonseca
Gabriel Queiroz de Brito Melo
Rafael Pereira de Paula de Lucas Simon
36
(Winners in 2011)