olymmath

ELMO 2013

ELMO 2013.

Official paper

The official paper in 1 language

English

Other problems

Problem 1

Let a1,a2,...,a9a_1,a_2,...,a_9 be nine real numbers, not necessarily distinct, with average mm . Let AA denote the number of triples 1≤i<j<k≤91 \le i < j < k \le 9 for which ai+aj+ak≥3ma_i + a_j + a_k \ge 3m . What is the minimum possible value of AA ?

Proposed by Ray Li

Problem 2

Let a,b,ca,b,c be positive reals satisfying a+b+c=a7+b7+c7a+b+c = \sqrt[7]{a} + \sqrt[7]{b} + \sqrt[7]{c} . Prove that aabbcc≥1a^a b^b c^c \ge 1 .

Proposed by Evan Chen

Problem 3

Let m1,m2,...,m2013>1m_1,m_2,...,m_{2013} > 1 be 2013 pairwise relatively prime positive integers and A1,A2,...,A2013A_1,A_2,...,A_{2013} be 2013 (possibly empty) sets with Ai⊆{1,2,...,mi−1}A_i\subseteq \{1,2,...,m_i-1\} for i=1,2,...,2013i=1,2,...,2013 . Prove that there is a positive integer NN such that N≤(2∣A1∣+1)(2∣A2∣+1)⋯(2∣A2013∣+1)N \le \left( 2\left\lvert A_1 \right\rvert + 1 \right)\left( 2\left\lvert A_2 \right\rvert + 1 \right)\cdots\left( 2\left\lvert A_{2013} \right\rvert + 1 \right) and for each i=1,2,...,2013i = 1, 2, ..., 2013 , there does not exist a∈Aia \in A_i such that mim_i divides N−aN-a .

Proposed by Victor Wang

Problem 4

Triangle ABCABC is inscribed in circle ω\omega . A circle with chord BCBC intersects segments ABAB and ACAC again at SS and RR , respectively. Segments BRBR and CSCS meet at LL , and rays LRLR and LSLS intersect ω\omega at DD and EE , respectively. The internal angle bisector of ∠BDE\angle BDE meets line ERER at KK . Prove that if BE=BRBE = BR , then ∠ELK=12∠BCD\angle ELK = \tfrac{1}{2} \angle BCD .

Proposed by Evan Chen

Problem 5

For what polynomials P(n)P(n) with integer coefficients can a positive integer be assigned to every lattice point in R3\mathbb{R}^3 so that for every integer n≥1n \ge 1 , the sum of the n3n^3 integers assigned to any n×n×nn \times n \times n grid of lattice points is divisible by P(n)P(n) ?

Proposed by Andre Arslan

Problem 6

Consider a function f:Z→Zf: \mathbb Z \to \mathbb Z such that for every integer n≥0n \ge 0 , there are at most 0.001n20.001n^2 pairs of integers (x,y)(x,y) for which f(x+y)≠f(x)+f(y)f(x+y) \neq f(x)+f(y) and max⁡{∣x∣,∣y∣}≤n\max\{ \lvert x \rvert, \lvert y \rvert \} \le n . Is it possible that for some integer n≥0n \ge 0 , there are more than nn integers aa such that f(a)≠a⋅f(1)f(a) \neq a \cdot f(1) and ∣a∣≤n\lvert a \rvert \le n ?

Proposed by David Yang