olymmath

ELMO SL 2012

ELMO Shortlist 2012.

Other problems

A1

Let x1,x2,x3,y1,y2,y3x_1,x_2,x_3,y_1,y_2,y_3 be nonzero real numbers satisfying x1+x2+x3=0,y1+y2+y3=0x_1+x_2+x_3=0, y_1+y_2+y_3=0. Prove that x1x2+y1y2(x12+y12)(x22+y22)+x2x3+y2y3(x22+y22)(x32+y32)+x3x1+y3y1(x32+y32)(x12+y12)≥−32.\frac{x_1x_2+y_1y_2}{\sqrt{(x_1^2+y_1^2)(x_2^2+y_2^2)}}+\frac{x_2x_3+y_2y_3}{\sqrt{(x_2^2+y_2^2)(x_3^2+y_3^2)}}+\frac{x_3x_1+y_3y_1}{\sqrt{(x_3^2+y_3^2)(x_1^2+y_1^2)}} \ge -\frac32.

Ray Li, Max Schindler.

A2

Let a,b,ca,b,c be three positive real numbers such that a≤b≤ca \le b \le c and a+b+c=1a+b+c=1. Prove that a+ca2+c2+b+cb2+c2+a+ba2+b2≤36(b+c)2(a2+b2)(b2+c2)(c2+a2).\frac{a+c}{\sqrt{a^2+c^2}}+\frac{b+c}{\sqrt{b^2+c^2}}+\frac{a+b}{\sqrt{a^2+b^2}} \le \frac{3\sqrt{6}(b+c)^2}{\sqrt{(a^2+b^2)(b^2+c^2)(c^2+a^2)}}.

Owen Goff.

A3

Prove that any polynomial of the form 1+anxn+an+1xn+1+⋯+akxk1+a_nx^n + a_{n+1}x^{n+1} + \cdots + a_kx^k (k≥nk\ge n) has at least n−2n-2 non-real roots (counting multiplicity), where the aia_i (n≤i≤kn\le i\le k) are real and ak≠0a_k\ne 0.

David Yang.

A4 · Also ELMO 2012 Problem 4

Let a0,b0a_0,b_0 be positive integers, and define ai+1=ai+⌊bi⌋a_{i+1}=a_i+\lfloor\sqrt{b_i}\rfloor and bi+1=bi+⌊ai⌋b_{i+1}=b_i+\lfloor\sqrt{a_i}\rfloor for all i≥0i\ge0 . Show that there exists a positive integer nn such that an=bna_n=b_n .

David Yang.

A5

Prove that if m,nm,n are relatively prime positive integers, xm−ynx^m-y^n is irreducible in the complex numbers. (A polynomial P(x,y)P(x,y) is irreducible if there do not exist nonconstant polynomials f(x,y)f(x,y) and g(x,y)g(x,y) such that P(x,y)=f(x,y)g(x,y)P(x,y) = f(x,y)g(x,y) for all x,yx,y .)

David Yang.

A6

Let a,b,c≥0a,b,c\ge0 . Show that (a2+2bc)2012+(b2+2ca)2012+(c2+2ab)2012≤(a2+b2+c2)2012+2(ab+bc+ca)2012(a^2+2bc)^{2012}+(b^2+2ca)^{2012}+(c^2+2ab)^{2012}\le (a^2+b^2+c^2)^{2012}+2(ab+bc+ca)^{2012} .

Calvin Deng.

A7 · Also ELMO 2012 Problem 3

Let f,gf, g be polynomials with complex coefficients such that gcd⁡(deg⁡f,deg⁡g)=1\gcd(\deg f, \deg g) = 1. Suppose that there exist polynomials P(x,y)P(x, y) and Q(x,y)Q(x, y) with complex coefficients such that f(x)+g(y)=P(x,y)Q(x,y)f(x) + g(y) = P(x, y)Q(x, y). Show that one of PP and QQ must be constant.

A8

Find all functions f:Q→Rf : \mathbb{Q} \to \mathbb{R} such that f(x)f(y)f(x+y)=f(xy)(f(x)+f(y))f(x)f(y)f(x+y) = f(xy)(f(x) + f(y)) for all x,y∈Qx,y\in\mathbb{Q} .

Sammy Luo and Alex Zhu.

A9

Let a,b,ca,b,c be distinct positive real numbers, and let kk be a positive integer greater than 33 . Show that ∣ak+1(b−c)+bk+1(c−a)+ck+1(a−b)ak(b−c)+bk(c−a)+ck(a−b)∣≥k+13(k−1)(a+b+c)\left\lvert\frac{a^{k+1}(b-c)+b^{k+1}(c-a)+c^{k+1}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{k+1}{3(k-1)}(a+b+c) and ∣ak+2(b−c)+bk+2(c−a)+ck+2(a−b)ak(b−c)+bk(c−a)+ck(a−b)∣≥(k+1)(k+2)3k(k−1)(a2+b2+c2).\left\lvert\frac{a^{k+2}(b-c)+b^{k+2}(c-a)+c^{k+2}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{(k+1)(k+2)}{3k(k-1)}(a^2+b^2+c^2).

Calvin Deng.

A10

Let A1A2A3A4A5A6A7A8A_1A_2A_3A_4A_5A_6A_7A_8 be a cyclic octagon. Let BiB_i by the intersection of AiAi+1A_iA_{i+1} and Ai+3Ai+4A_{i+3}A_{i+4} . (Take A9=A1A_9 = A_1 , A10=A2A_{10} = A_2 , etc.) Prove that B1,B2,…,B8B_1, B_2, \ldots , B_8 lie on a conic.

David Yang.

C1

Let n≥2n\ge2 be a positive integer. Given a sequence (si)\left(s_i\right) of nn distinct real numbers, define the "class" of the sequence to be the sequence (a1,a2,…,an−1)\left(a_1,a_2,\ldots,a_{n-1}\right) , where aia_i is 11 if si+1>sis_{i+1} > s_i and −1-1 otherwise.

Find the smallest integer mm such that there exists a sequence (wi)\left(w_i\right) of length mm such that for every possible class of a sequence of length nn , there is a subsequence of (wi)\left(w_i\right) that has that class.

David Yang.

C2

Determine whether it's possible to cover a K2012K_{2012} with

a) 1000 K1006K_{1006} 's;

b) 1000 K1006,1006K_{1006,1006} 's.

David Yang.

C3 · Also ELMO 2012 Problem 2

Find all ordered pairs of positive integers (m,n)(m,n) for which there exists a set C={c1,…,ck}C=\{c_1,\ldots,c_k\} ( k≥1k\ge1 ) of colors and an assignment of colors to each of the mnmn unit squares of a m×nm\times n grid such that for every color ci∈Cc_i\in C and unit square SS of color cic_i , exactly two direct (non-diagonal) neighbors of SS have color cic_i .

David Yang.

C4

A tournament on 2k2k vertices contains no 77 -cycles. Show that its vertices can be partitioned into two sets, each with size kk , such that the edges between vertices of the same set do not determine any 33 -cycles.

Calvin Deng.

C5

Form the infinite graph AA by taking the set of primes pp congruent to 1(mod4)1\pmod{4} , and connecting pp and qq if they are quadratic residues modulo each other. Do the same for a graph BB with the primes 1(mod8)1\pmod{8} . Show AA and BB are isomorphic to each other.

Linus Hamilton.

C6

Consider a directed graph GG with nn vertices, where 11 -cycles and 22 -cycles are permitted. For any set SS of vertices, let N+(S)N^{+}(S) denote the out-neighborhood of SS (i.e. set of successors of SS ), and define (N+)k(S)=N+((N+)k−1(S))(N^{+})^k(S)=N^{+}((N^{+})^{k-1}(S)) for k≥2k\ge2 .

For fixed nn , let f(n)f(n) denote the maximum possible number of distinct sets of vertices in {(N+)k(X)}k=1∞\{(N^{+})^k(X)\}_{k=1}^{\infty} , where XX is some subset of V(G)V(G) . Show that there exists n>2012n>2012 such that f(n)<1.0001nf(n)<1.0001^n .

Linus Hamilton.

C7

Consider a graph GG with nn vertices and at least n2/10n^2/10 edges. Suppose that each edge is colored in one of cc colors such that no two incident edges have the same color. Assume further that no cycles of size 1010 have the same set of colors. Prove that there is a constant kk such that cc is at least kn85kn^\frac{8}{5} for any nn .

David Yang.

C8

Consider the equilateral triangular lattice in the complex plane defined by the Eisenstein integers; let the ordered pair (x,y)(x,y) denote the complex number x+yωx+y\omega for ω=e2πi/3\omega=e^{2\pi i/3} . We define an ω\omega -chessboard polygon to be a (non self-intersecting) polygon whose sides are situated along lines of the form x=ax=a or y=by=b , where aa and bb are integers. These lines divide the interior into unit triangles, which are shaded alternately black and white so that adjacent triangles have different colors. To tile an ω\omega -chessboard polygon by lozenges is to exactly cover the polygon by non-overlapping rhombuses consisting of two bordering triangles. Finally, a tasteful tiling is one such that for every unit hexagon tiled by three lozenges, each lozenge has a black triangle on its left (defined by clockwise orientation) and a white triangle on its right (so the lozenges are BW, BW, BW in clockwise order).

a) Prove that if an ω\omega -chessboard polygon can be tiled by lozenges, then it can be done so tastefully.

b) Prove that such a tasteful tiling is unique.

Victor Wang.

C9

For a set AA of integers, define f(A)={x2+xy+y2:x,y∈A}f(A)=\{x^2+xy+y^2: x,y\in A\} . Is there a constant cc such that for all positive integers nn , there exists a set AA of size nn such that ∣f(A)∣≤cn|f(A)|\le cn ?

David Yang.

G1 · Also ELMO 2012 Problem 1

In acute triangle ABCABC , let D,E,FD,E,F denote the feet of the altitudes from A,B,CA,B,C , respectively, and let ω\omega be the circumcircle of △AEF\triangle AEF . Let ω1\omega_1 and ω2\omega_2 be the circles through DD tangent to ω\omega at EE and FF , respectively. Show that ω1\omega_1 and ω2\omega_2 meet at a point PP on BCBC other than DD .

Ray Li.

G2

In triangle ABCABC , PP is a point on altitude ADAD . Q,RQ,R are the feet of the perpendiculars from PP to AB,ACAB,AC , and QP,RPQP,RP meet BCBC at SS and TT respectively. the circumcircles of BQSBQS and CRTCRT meet QRQR at X,YX,Y .

a) Prove SX,TY,ADSX,TY, AD are concurrent at a point ZZ .

b) Prove ZZ is on QRQR iff Z=HZ=H , where HH is the orthocenter of ABCABC .

Ray Li.

G3

ABCABC is a triangle with incenter II . The foot of the perpendicular from II to BCBC is DD , and the foot of the perpendicular from II to ADAD is PP . Prove that ∠BPD=∠DPC\angle BPD = \angle DPC .

Alex Zhu.

G4

Circles Ω\Omega and ω\omega are internally tangent at point CC . Chord ABAB of Ω\Omega is tangent to ω\omega at EE , where EE is the midpoint of ABAB . Another circle, ω1\omega_1 is tangent to Ω,ω,\Omega, \omega, and ABAB at D,Z,D,Z, and FF respectively. Rays CDCD and ABAB meet at PP . If MM is the midpoint of major arc ABAB , show that tan⁡∠ZEP=PECM\tan \angle ZEP = \tfrac{PE}{CM} .

Ray Li.

G5 · Also ELMO 2012 Problem 5

Let ABCABC be an acute triangle with AB<ACAB<AC , and let DD and EE be points on side BCBC such that BD=CEBD=CE and DD lies between BB and EE . Suppose there exists a point PP inside ABCABC such that PD∥AEPD\parallel AE and ∠PAB=∠EAC\angle PAB=\angle EAC . Prove that ∠PBA=∠PCA\angle PBA=\angle PCA .

Calvin Deng.

G6

In △ABC\triangle ABC , HH is the orthocenter, and AD,BEAD,BE are arbitrary cevians. Let ω1,ω2\omega_1, \omega_2 denote the circles with diameters ADAD and BEBE , respectively. HD,HEHD,HE meet ω1,ω2\omega_1,\omega_2 again at F,GF,G . DEDE meets ω1,ω2\omega_1,\omega_2 again at P1,P2P_1,P_2 respectively. FGFG meets ω1,ω2\omega_1,\omega_2 again Q1,Q2Q_1,Q_2 respectively. P1H,Q1HP_1H,Q_1H meet ω1\omega_1 at R1,S1R_1,S_1 respectively. P2H,Q2HP_2H,Q_2H meet ω2\omega_2 at R2,S2R_2,S_2 respectively. Let P1Q1∩P2Q2=XP_1Q_1\cap P_2Q_2 = X , and R1S1∩R2S2=YR_1S_1\cap R_2S_2=Y . Prove that X,Y,HX,Y,H are collinear.

Ray Li.

G7

Let △ABC\triangle ABC be an acute triangle with circumcenter OO such that AB<ACAB<AC , let QQ be the intersection of the external bisector of ∠A\angle A with BCBC , and let PP be a point in the interior of △ABC\triangle ABC such that △BPA\triangle BPA is similar to △APC\triangle APC . Show that ∠QPA+∠OQB=90∘\angle QPA + \angle OQB = 90^{\circ} .

Alex Zhu.

N1

Find all positive integers nn such that 4n+6n+9n4^n+6^n+9^n is a square.

David Yang, Alex Zhu.

N2

For positive rational xx , if xx is written in the form p/qp/q with p,qp, q positive relatively prime integers, define f(x)=p+qf(x)=p+q . For example, f(1)=2f(1)=2 .

a) Prove that if f(x)=f(mx/n)f(x)=f(mx/n) for rational xx and positive integers m,nm, n , then f(x)f(x) divides ∣m−n∣|m-n| .

b) Let nn be a positive integer. If all xx which satisfy f(x)=f(2nx)f(x)=f(2^nx) also satisfy f(x)=2n−1f(x)=2^n-1 , find all possible values of nn .

Anderson Wang.

N3

Let s(k)s(k) be the number of ways to express kk as the sum of distinct 2012th2012^{th} powers, where order does not matter. Show that for every real number cc there exists an integer nn such that s(n)>cns(n)>cn .

Alex Zhu.

N4

Do there exist positive integers b,n>1b,n>1 such that when nn is expressed in base bb , there are more than nn distinct permutations of its digits? For example, when b=4b=4 and n=18n=18 , 18=102418 = 102_4 , but 102102 only has 66 digit arrangements. (Leading zeros are allowed in the permutations.)

Lewis Chen.

N5

Let n>2n>2 be a positive integer and let pp be a prime. Suppose that the nonzero integers are colored in nn colors. Let a1,a2,…,ana_1,a_2,\ldots,a_{n} be integers such that for all 1≤i≤n1\le i\le n , pi∤aip^i\nmid a_i and pi−1∣aip^{i-1}\mid a_i . In terms of nn , pp , and {ai}i=1n\{a_i\}_{i=1}^{n} , determine if there must exist integers x1,x2,…,xnx_1,x_2,\ldots,x_{n} of the same color such that a1x1+a2x2+⋯+anxn=0a_1x_1+a_2x_2+\cdots+a_{n}x_{n}=0 .

Ravi Jagadeesan.

N6

Prove that if aa and bb are positive integers and ab>1ab>1 , then ⌊(a−b)2−1ab⌋=⌊(a−b)2−1ab−1⌋.\left\lfloor\frac{(a-b)^2-1}{ab}\right\rfloor=\left\lfloor\frac{(a-b)^2-1}{ab-1}\right\rfloor.Here ⌊x⌋\lfloor x\rfloor denotes the greatest integer not exceeding xx .

Calvin Deng.

N7 · Also ELMO 2012 Problem 6

A diabolical combination lock has nn dials (each with cc possible states), where n,c>1n,c>1 . The dials are initially set to states d1,d2,…,dnd_1, d_2, \ldots, d_n , where 0≤di≤c−10\le d_i\le c-1 for each 1≤i≤n1\le i\le n . Unfortunately, the actual states of the dials (the did_i 's) are concealed, and the initial settings of the dials are also unknown. On a given turn, one may advance each dial by an integer amount cic_i ( 0≤ci≤c−10\le c_i\le c-1 ), so that every dial is now in a state di′≡di+ci(modc)d_i '\equiv d_i+c_i \pmod{c} with 0≤di′≤c−10\le d_i ' \le c-1 . After each turn, the lock opens if and only if all of the dials are set to the zero state; otherwise, the lock selects a random integer kk and cyclically shifts the did_i 's by kk (so that for every ii , did_i is replaced by di−kd_{i-k} , where indices are taken modulo nn ).

Show that the lock can always be opened, regardless of the choices of the initial configuration and the choices of kk (which may vary from turn to turn), if and only if nn and cc are powers of the same prime.

Bobby Shen.

N8

Fix two positive integers a,k≥2a,k\ge2 , and let f∈Z[x]f\in\mathbb{Z}[x] be a nonconstant polynomial. Suppose that for all sufficiently large positive integers nn , there exists a rational number xx satisfying f(x)=f(an)kf(x)=f(a^n)^k . Prove that there exists a polynomial g∈Q[x]g\in\mathbb{Q}[x] such that f(g(x))=f(x)kf(g(x))=f(x)^k for all real xx .

Victor Wang.

N9

Are there positive integers m,nm,n such that there exist at least 20122012 positive integers xx such that both m−x2m-x^2 and n−x2n-x^2 are perfect squares?

David Yang.