20th IMC
IMC 2013
Blagoevgrad, Bulgaria · paper 2 on 9 August 2013 · 10 problems across 2 papers
Day 1
5 problemsProblem 1 Let and be real symmetric matrices with all eigenvalues strictly greater than . Let be a real eigenvalue of matrix . Prove that .
Problem 2 Let be a twice differentiable function. Suppose . Prove that there exists such that
Problem 3 There are students in a school (, ). Each week students go on a trip. After several trips the following condition was fulfilled: every two students were together on at least one trip. What is the minimum number of trips needed for this to happen?
Problem 4 Let and let be nonnegative real numbers. Define , and . Prove that
Problem 5 Does there exist a sequence of complex numbers such that for every positive integer we have that converges if and only if is not a prime?
Day 2
9 August 2013 · 5 problemsProblem 1 Let be a complex number with . Prove that .
Problem 2 Let and be relatively prime positive integers. Prove that
(Here denotes the integer part of .)
Problem 3 Suppose that are unit vectors in . Prove that there exists a unit vector such that
for .
(Here denotes the usual scalar product on .)
Problem 4 Does there exist an infinite set consisting of positive integers such that for any , with , the sum is square-free?
(A positive integer is called square-free if no perfect square greater than divides it.)
Problem 5 Consider a circular necklace with beads. Each bead can be painted either white or green. A painting of the necklace is called good, if among any successive beads there is at least one green bead. Prove that the number of good paintings of the necklace is odd.
(Two paintings that differ on some beads, but can be obtained from each other by rotating or flipping the necklace, are counted as different paintings.)