Scribd
Upload
92 views3 pages

Problems

The document contains 20 math problems posed at a competition held on November 10, 2012 in Tartu, Estonia. The problems cover a range of topics including number theory, algebra, geometry and combinatorics. Competitors had 4 hours and 30 minutes to solve the problems and were allowed to ask questions during the first 30 minutes.

Uploaded by

george
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
92 views3 pages

Problems

The document contains 20 math problems posed at a competition held on November 10, 2012 in Tartu, Estonia. The problems cover a range of topics including number theory, algebra, geometry and combinatorics. Competitors had 4 hours and 30 minutes to solve the problems and were allowed to ask questions during the first 30 minutes.

Uploaded by

george
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Problems

10 November 2012, Tartu, Estonia

–English version–

Time allowed: 4 hours and 30 minutes.


Questions may be asked during the first 30 minutes.
Tools for writing and drawing are the only ones allowed.
Problem 1. The numbers from 1 to 360 are partitioned into 9 subsets of consecutive integers and
the sums of the numbers in each subset are arranged in the cells of a 3 × 3 square. Is it possible
that the square turns out to be a magic square?
Remark: A magic square is a square in which the sums of the numbers in each row, in each column
and in both diagonals are all equal.
Problem 2. Let a, b, c be real numbers. Prove that
1
ab + bc + ca + max{|a − b|, |b − c|, |c − a|} ≤ 1 + (a + b + c)2 .
3

Problem 3. a) Show that the equation

⌊x⌋(x2 + 1) = x3 ,

where ⌊x⌋ denotes the largest integer not larger than x, has exactly one real solution in each interval
between consecutive positive integers.
b) Show that none of the positive real solutions of this equation is rational.
Problem 4. Prove that for infinitely many pairs (a, b) of integers the equation

x2012 = ax + b

has among its solutions two distinct real numbers whose product is 1.
Problem 5. Find all functions f : R → R for which

f (x + y) = f (x − y) + f (f (1 − xy))

holds for all real numbers x and y.


Problem 6. There are 2012 lamps arranged on a table. Two persons play the following game. In
each move the player flips the switch of one lamp, but he must never get back an arrangement of
the lit lamps that has already been on the table. A player who cannot move loses. Which player
has a winning strategy?
Problem 7. On a 2012×2012 board, some cells on the top-right to bottom-left diagonal are marked.
None of the marked cells is in a corner. Integers are written in each cell of this board in the following
way. All the numbers in the cells along the upper and the left sides of the board are 1’s. All the
numbers in the marked cells are 0’s. Each of the other cells contains a number that is equal to
the sum of its upper neighbour and its left neighbour. Prove that the number in the bottom right
corner is not divisible by 2011.
Problems
10 November 2012, Tartu, Estonia

–English version–

Problem 8. A directed graph does not contain directed cycles. The number of edges in any directed
path does not exceed 99. Prove that it is possible to colour the edges of the graph in 2 colours so
that the number of edges in any single-coloured directed path in the graph will not exceed 9.

Problem 9. Zeroes are written in all cells of a 5 × 5 board. We can take an arbitrary cell and
increase by 1 the number in this cell and all cells having a common side with it. Is it possible to
obtain the number 2012 in all cells simultaneously?

Problem 10. Two players A and B play the following game. Before the game starts, A chooses
1000 not necessarily different odd primes, and then B chooses half of them and writes them on a
blackboard. In each turn a player chooses a positive integer n, erases some primes p1 , p2 , . . ., pn
from the blackboard and writes all the prime factors of p1 p2 . . . pn − 2 instead (if a prime occurs
several times in the prime factorization of p1 p2 . . . pn − 2, it is written as many times as it occurs).
Player A starts, and the player whose move leaves the blackboard empty loses the game. Prove that
one of the two players has a winning strategy and determine who.
Remark: Since 1 has no prime factors, erasing a single 3 is a legal move.

Problem 11. Let ABC be a triangle with ∠A = 60◦ . The point T lies inside the triangle in such
a way that ∠AT B = ∠BT C = ∠CT A = 120◦ . Let M be the midpoint of BC. Prove that
T A + T B + T C = 2AM .

Problem 12. Let P0 , P1 , . . . , P8 = P0 be successive points on a circle and Q be a point inside the
polygon P0 P1 . . . P7 such that ∠Pi−1 QPi = 45◦ for i = 1, . . . , 8. Prove that the sum

X
8
Pi−1 Pi 2
i=1

is minimal if and only if Q is the centre of the circle.

Problem 13. Let ABC be an acute triangle, and let H be its orthocentre. Denote by HA , HB and
HC the second intersection of the circumcircle with the altitudes from A, B and C respectively.
Prove that the area of △HA HB HC does not exceed the area of △ABC.

Problem 14. Given a triangle ABC, let its incircle touch the sides BC, CA, AB at D, E, F ,
respectively. Let G be the midpoint of the segment DE. Prove that ∠EF C = ∠GF D.

Problem 15. The circumcentre O of a given cyclic quadrilateral ABCD lies inside the quadrilateral
but not on the diagonal AC. The diagonals of the quadrilateral intersect at I. The circumcircle of
the triangle AOI meets the sides AD and AB at points P and Q, respectively; the circumcircle of
the triangle COI meets the sides CB and CD at points R and S, respectively. Prove that P QRS
is a parallelogram.

Problem 16. Let n, m and k be positive integers satisfying (n − 1)n(n + 1) = mk . Prove that
k = 1.
Problems
10 November 2012, Tartu, Estonia

–English version–

Problem 17. Let d(n) denote the number of positive divisors of n. Find all triples (n, k, p), where
n and k are positive integers and p is a prime number, such that

nd(n) − 1 = pk .

Problem 18. Find all triples (a, b, c) of integers satisfying a2 + b2 + c2 = 20122012.

Problem 19. Show that nn + (n + 1)n+1 is composite for infinitely many positive integers n.

Problem 20. Find all integer solutions of the equation 2x6 + y 7 = 11.

You might also like