olymmath

RMO 2019

Indian Regional Mathematical Olympiad 2019.

Official paper

The official paper in 1 language

English

Other problems

Problem 1

Suppose xx is a non zero real number such that both x5x^5 and 20x+19x20x+\frac{19}{x} are rational numbers. Prove that xx is a rational number.

Problem 2

Let ABCABC be a triangle with circumcircle Ω\Omega and let GG be the centroid of triangle ABCABC . Extend AG,BGAG, BG and CGCG to meet the circle Ω\Omega again in A1,B1A_1, B_1 and C1C_1 . Suppose ∠BAC=∠A1B1C1,∠ABC=∠A1C1B1\angle BAC = \angle A_1 B_1 C_1, \angle ABC = \angle A_1 C_1 B_1 and ∠ACB=B1A1C1\angle ACB = B_1 A_1 C_1 . Prove that ABCABC and A1B1C1A_1 B_1 C_1 are equilateral triangles.

Problem 3

Let a,b,ca,b,c be positive real numbers such that a+b+c=1a+b+c=1 . Prove that aa2+b3+c3+bb2+a3+c3+cc2+a3+b3≤15abc\frac{a}{a^2+b^3+c^3}+\frac{b}{b^2+a^3+c^3}+\frac{c}{c^2+a^3+b^3}\leq\frac{1}{5abc}

Problem 4

Consider the following 3×23\times 2 array formed by using the numbers 1,2,3,4,5,61,2,3,4,5,6 , (a11a12a21a22a31a32)=(162534).\begin{pmatrix} a_{11}& a_{12}a_{21}& a_{22} a_{31}& a_{32}\end{pmatrix}=\begin{pmatrix}1& 62& 5 3& 4\end{pmatrix}. Observe that all row sums are equal, but the sum of the square of the squares is not the same for each row. Extend the above array to a 3×k3\times k array (aij)3×k(a_{ij})_{3\times k} for a suitable kk , adding more columns, using the numbers 7,8,9,…,3k7,8,9,\dots ,3k such that ∑j=1ka1j=∑j=1ka2j=∑j=1ka3j  and  ∑j=1k(a1j)2=∑j=1k(a2j)2=∑j=1k(a3j)2\sum_{j=1}^k a_{1j}=\sum_{j=1}^k a_{2j}=\sum_{j=1}^k a_{3j}~~\text{and}~~\sum_{j=1}^k (a_{1j})^2=\sum_{j=1}^k (a_{2j})^2=\sum_{j=1}^k (a_{3j})^2

Problem 5

In an acute angled triangle ABCABC , let HH be the orthocenter, and let D,E,FD,E,F be the feet of altitudes from A,B,CA,B,C to the opposite sides, respectively. Let L,M,NL,M,N be the midpoints of the segments AH,EF,BCAH, EF, BC respectively. Let X,YX,Y be the feet of altitudes from L,NL,N on to the line DFDF respectively. Prove that XMXM is perpendicular to MYMY .

Problem 6

Suppose 9191 distinct positive integers greater than 11 are given such that there are at least 456456 pairs among them which are relatively prime. Show that one can find four integers a,b,c,da, b, c, d among them such that gcd⁡(a,b)=gcd⁡(b,c)=gcd⁡(c,d)=gcd⁡(d,a)=1.\gcd(a,b)=\gcd(b,c)=\gcd(c,d)=\gcd(d,a)=1.