Junior problems J205. Find the greatest n-digit number a1 a2 ...

an with the following properties: i) all its digits are dierent from zero and distinct; ii) for each k = 2, ..., n 1, sequence.
1 1 1 ak1 , ak , ak+1

is either an arithmetic sequence or a geometric

Proposed by Titu Andreescu, University of Texas at Dallas, USA J206. Let A, B, C, X, Y , Z be points in the plane. Prove that the circumcircles of triangles AY Z, BZX, CXY are concurrent if and only if the circumcircles of triangles XBC, Y CA, ZAB are concurrent. Proposed by Cosmin Pohoata, Princeton University, USA J207. Find the greatest number of the form 2a 5b + 1, with a and b nonnegative integers, that divides a number all whose digits are distinct. Proposed by Titu Andreescu, University of Texas at Dallas, USA J208. Let K be the symmedian point of triangle ABC and let R be its circumradius. Prove that AK + BK + CK 3R. Proposed by Ivan Borsenco, Massachusetts Institute of Technology, USA J209. Let a, b, c be positive real numbers such that a + b + c = 1. Prove that 32 (b + c)5 (c + a)5 (a + b)5 + + (ab + bc + ca). a b c 9 Proposed by Marius Stanean and Mircea Lascu, Zalau, Romania J210. Let P and Q be points in the plane of triangle ABC such that {AP, BP, CP } = {AQ, BQ, CQ}. Prove that 1 1 OP 2 + P G2 = OQ2 + QG2 , 3 3 where O and G are the circumcenter and centroid of triangle ABC, respectively. Proposed by Ivan Borsenco, Massachusetts Institute of Technology, USA

Mathematical Reflections 5 (2011)

Senior problems S205. Let C0 (O, R) be a circle and let I be a point at distance d < R from O. Consider circles C1 (I, r1 ) and C2 (I, r2 ) such that there is a triangle inscirbed in C0 and circumscribed about C1 and there is a quadrilateral inscribed in C0 and circumscribed about C2 . Prove that 1 < r2 2. r1 Proposed by Ivan Borsenco, Massachusetts Institute of Technology, USA S206. Find all integers n 2 having a prime divisor p such that n 1 is divisible by the exponent of p in n!. Proposed by Tigran Hakobyan, Yerevan, Armenia S207. Let a, b, c be distinct nonzero real numbers such that ab + bc + ca = 3 and a + b + c = 2 abc + abc . Prove that
cyc

a(b c) bc 1

cyc

bc 1 a(b c)

is the square of an integer. Proposed by Titu Andreescu, University of Texas at Dallas, USA S208. Let f Z[X] be such that f (1) + f (2) + . . . + f (n) is a perfect square for all positive integers n. Prove that there exist a positive integer k and a polynomial g Z[X] with g(0) = 0 and k 2 f (X) = g 2 (X) g 2 (X 1). Proposed by Vlad Matei, University of Cambridge, United Kingdom S209. Let a, b, c be the sidelengths, s the semiperimeter, r the inradius, and R the circumradius of a triangle ABC. Prove that sr R 1+ R 2r 4R + r (s b) (s c) (s c) (s a) (s a) (s b) + + . a b c

Proposed by Darij Grinberg, Massachusetts Institute of Technology, and Cosmin Pohoata, Princeton University, USA S210. Let p be an odd prime and let F (X) = (1)
p1 2

p1 2k 2 k=0 k

X k . Prove that for all x Z,

F (x) F

1 x . 16

Proposed by Gabriel Dospinescu, Ecole Polytehnique, France

Mathematical Reflections 5 (2011)

Undergraduate problems U205. Let E be a vector space with norms

and 2 . Decide if min(

1,

2 ) is a norm.

Proposed by Roberto Bosch Cabrera, Florida, USA U206. Prove that there is precisely one group with 30 elements and 8 automorphisms. Proposed by Gabriel Dospinescu, Ecole Polytehnique, France U207. Let n 3 be an odd integer. Evaluate
n1 2

sec
k=1

2k . n

Proposed by Titu Andreescu, University of Texas at Dallas, USA U208. Let X and Y be standard Cauchy random variables C(0, 1). Prove that the probability density function of random variable Z = X 2 + Y 2 is given by fZ (t) = 2 1 . (t + 2) t + 1

Proposed by Ivan Borsenco, Massachusetts Institute of Technology, USA U209. Let k 2 be a positive integer and G be an (k 1)-edge-connected k-regular graph with an even number of vertices. Prove that for every edge e of the graph there is a perfect matching of G containing e. Proposed by Cosmin Pohoata, Princeton University, USA U210. A graph G arises from G1 and G2 by pasting them along S if G has induced subgraphs G1 , G2 with G = G1 G2 and S is such that S = G1 G2 . A graph is called chordal if it can be constructed recursively by pasting along complete subgraphs, starting from complete subgraphs. For a graph G(V, E) dene its Hilbert polynomial HG (x) to be HG (x) = 1 + V x + Ex2 + c(K3 )x3 + c(K4 )x4 + . . . + c(K(G) )x(G) , where c(Ki ) is the number of i cliques in G and (G) is the clique number of G. Prove that HG (1) = 0 if and only if G is chordal. Proposed by Ivan Borsenco, Massachusetts Institute of Technology, USA

Mathematical Reflections 5 (2011)

Olympiad problems O205. Find all n such that each number containing n 1s and one 3 is prime. Proposed by Titu Andreescu, University of Texas at Dallas, USA O206. Let D BC be the foot of the A-symmedian of triangle ABC with centroid G. The circle passing through A and tangent to BC at D intersects sides AB and AC at E and F , respectively. If 3AD2 = AB 2 + AC 2 , prove that G lies on EF . Proposed by Marius Stanean, Zalau, Romania O207. Dene a sequence (xn )n1 of rational numbers by x1 = x2 = x3 = 1 and xn xn3 = x2 + xn1 xn2 + x2 n1 n2 for all n 4. Prove that xn is an integer for every positive integer n. Proposed by Darij Grinberg, Massachusetts Institute of Technology, USA
k k k O208. Let z1 , z2 , ..., zn be complex numbers such that z1 + z2 + ... + zn is the k-th power of a rational number for all k > 2011. Prove that at most one of the numbers zi is nonzero.

Proposed by Gabriel Dospinescu, Ecole Polytehnique, France and Octav Dragoi, ICHB, Bucharest, Romania O209. Let P be a point on the side BC of triangle ABC with circumcircle , and let T1 and T2 be the circles internally tangent to and also to AP , BP , and AP , CP , respectively. If I is the incenter of triangle ABC and M is the midpoint of the arc BC of not containing the vertex A, prove that the radical axis of T1 and T2 is the line determined by M and the midpoint of the segment IP . Proposed by Cosmin Pohoata, Princeton University, USA O210. Suppose that the set of positive integers is partitioned into a set of sequences (Ln,i )i1 such that Ln,i divides Ln,i+1 for all positive integers n and i. Prove that for all positive integers t, there are innitely many n such that (Ln,1 ) = t, where for a positive integer a, decomposed into primes as a = p1 p2 ...pr , (a) = 1 + 2 + ... + r . r 1 2 Proposed by Radu Bumbacea, Bucharest, Romania

Mathematical Reflections 5 (2011)