🇮🇳 INMO · 2019

INMO 2019

Indian National Mathematical Olympiad 2019 — 6 problems with solutions

INMO 2019

Indian National Mathematical Olympiad 2019. 6 problems. Problems sourced from MathNet (CC BY 4.0). Solutions are expert-authored.


Problem 1

Number Theory
Problem

Let p1<p2<p3<p4p_{1} < p_{2} < p_{3} < p_{4} and q1<q2<q3<q4q_{1} < q_{2} < q_{3} < q_{4} be two sets of prime numbers such that p4p1=8p_{4} - p_{1} = 8 and q4q1=8q_{4} - q_{1} = 8. Suppose p1>5p_{1} > 5 and q1>5q_{1} > 5. Prove that 3030 divides p1q1p_{1} - q_{1}.

View Solution

Since p4p1=8p_{4} - p_{1} = 8, and no prime is even, we observe that {p1,p2,p3,p4}\{p_{1}, p_{2}, p_{3}, p_{4}\} is a subset of {p1,p1+2,p1+4,p1+6,p1+8}\{p_{1}, p_{1} + 2, p_{1} + 4, p_{1} + 6, p_{1} + 8\}. Moreover p1p_{1} is larger than 33. If p11(mod3)p_{1} \equiv 1 \pmod{3}, then p1+2p_{1} + 2 and p1+8p_{1} + 8 are divisible by 33. Hence we do not get 44 primes in the set {p1,p1+2,p1+4,p1+6,p1+8}\{p_{1}, p_{1} + 2, p_{1} + 4, p_{1} + 6, p_{1} + 8\}. Thus p12(mod3)p_{1} \equiv 2 \pmod{3} and p1+4p_{1} + 4 is not a prime. We get p2=p1+2p_{2} = p_{1} + 2, p3=p1+6p_{3} = p_{1} + 6, p4=p1+8p_{4} = p_{1} + 8.

Consider the remainders of p1,p1+2,p1+6,p1+8p_{1}, p_{1} + 2, p_{1} + 6, p_{1} + 8 when divided by 55. If p12(mod5)p_{1} \equiv 2 \pmod{5}, then p1+8p_{1} + 8 is divisible by 55 and hence is not a prime. If p13(mod5)p_{1} \equiv 3 \pmod{5}, then p1+2p_{1} + 2 is divisible by 55. If p14(mod5)p_{1} \equiv 4 \pmod{5}, then p1+6p_{1} + 6 is divisible by 55. Hence the only possibility is p11(mod5)p_{1} \equiv 1 \pmod{5}.

Thus we see that p11(mod2)p_{1} \equiv 1 \pmod{2}, p12(mod3)p_{1} \equiv 2 \pmod{3} and p11(mod5)p_{1} \equiv 1 \pmod{5}. We conclude that p111(mod30)p_{1} \equiv 11 \pmod{30}.

Similarly q111(mod30)q_{1} \equiv 11 \pmod{30}. It follows that 3030 divides p1q1p_{1} - q_{1}.


Problem 2

Algebra
Problem

Define a sequence f0(x),f1(x),f2(x),\langle f_{0}(x), f_{1}(x), f_{2}(x), \ldots \rangle of functions by

f0(x)=1,f1(x)=x,(fn(x))21=fn+1(x)fn1(x), for n1f_{0}(x)=1, \quad f_{1}(x)=x, \quad (f_{n}(x))^{2}-1=f_{n+1}(x) f_{n-1}(x), \text{ for } n \geq 1

Prove that each fn(x)f_{n}(x) is a polynomial with integer coefficients.

View Solution

Observe that

fn2(x)fn1(x)fn+1(x)=1=fn12(x)fn2(x)fn(x)f_{n}^{2}(x)-f_{n-1}(x) f_{n+1}(x)=1=f_{n-1}^{2}(x)-f_{n-2}(x) f_{n}(x)

This gives

fn(x)(fn(x)+fn2(x))=fn1(fn1(x)+fn+1(x))f_{n}(x)\left(f_{n}(x)+f_{n-2}(x)\right)=f_{n-1}\left(f_{n-1}(x)+f_{n+1}(x)\right)

We write this as

fn1(x)+fn+1(x)fn(x)=fn2(x)+fn(x)fn1(x)\frac{f_{n-1}(x)+f_{n+1}(x)}{f_{n}(x)}=\frac{f_{n-2}(x)+f_{n}(x)}{f_{n-1}(x)}

Using induction, we get

fn1(x)+fn+1(x)fn(x)=f0(x)+f2(x)f1(x)\frac{f_{n-1}(x)+f_{n+1}(x)}{f_{n}(x)}=\frac{f_{0}(x)+f_{2}(x)}{f_{1}(x)}

Observe that

f2(x)=f12(x)1f0(x)=x21f_{2}(x)=\frac{f_{1}^{2}(x)-1}{f_{0}(x)}=x^{2}-1

Hence

fn1(x)+fn+1(x)fn(x)=1+(x21)x=x\frac{f_{n-1}(x)+f_{n+1}(x)}{f_{n}(x)}=\frac{1+\left(x^{2}-1\right)}{x}=x

Thus we obtain

fn+1(x)=xfn(x)fn1(x)f_{n+1}(x)=x f_{n}(x)-f_{n-1}(x)

Since f0(x),f1(x)f_{0}(x), f_{1}(x) and f2(x)f_{2}(x) are polynomials with integer coefficients, induction again shows that fn(x)f_{n}(x) is a polynomial with integer coefficients.


Problem 3

Geometry Combinatorics
Problem

Let ABCABC be a triangle. An interior point PP of ABCABC is said to be good if we can find exactly 2727 rays emanating from PP intersecting the sides of the triangle ABCABC such that the triangle is divided by these rays into 2727 smaller triangles of equal area. Determine the number of good points for a given triangle ABCABC.

View Solution

Let PP be a good point. Let l,m,nl, m, n be respectively the number of parts the sides BC,CA,ABBC, CA, AB are divided by the rays starting from PP. Note that a ray must pass through each of the vertices of the triangle ABCABC; otherwise we get some quadrilaterals.

Let h1h_1 be the distance of PP from BCBC. Then h1h_1 is the height for all the triangles with their bases on BCBC. Equality of areas implies that all these bases have equal length. If we denote this by xx, we get lx=al x = a. Similarly, taking yy and zz as the lengths of the bases of triangles on CACA and ABAB respectively, we get my=bm y = b and nz=cn z = c. Let h2h_2 and h3h_3 be the distances of PP from CACA and ABAB respectively. Then

h1x=h2y=h3z=2Δ27h_1 x = h_2 y = h_3 z = \frac{2 \Delta}{27}

where Δ\Delta denotes the area of the triangle ABCABC. These lead to

h1=2Δ27la,h2=2Δ27mb,h3=2Δ27nch_1 = \frac{2 \Delta}{27} \frac{l}{a}, \quad h_2 = \frac{2 \Delta}{27} \frac{m}{b}, \quad h_3 = \frac{2 \Delta}{27} \frac{n}{c}

But

2Δa=ha,2Δb=hb,2Δc=hc\frac{2 \Delta}{a} = h_a, \quad \frac{2 \Delta}{b} = h_b, \quad \frac{2 \Delta}{c} = h_c

Thus we get

h1ha=l27,h2hb=m27,h3hc=n27\frac{h_1}{h_a} = \frac{l}{27}, \quad \frac{h_2}{h_b} = \frac{m}{27}, \quad \frac{h_3}{h_c} = \frac{n}{27}

However, we also have

h1ha=[PBC]Δ,h2hb=[PCA]Δ,h3hc=[PAB]Δ\frac{h_1}{h_a} = \frac{[PBC]}{\Delta}, \quad \frac{h_2}{h_b} = \frac{[PCA]}{\Delta}, \quad \frac{h_3}{h_c} = \frac{[PAB]}{\Delta}

Adding these three relations,

h1ha+h2hb+h3hc=1\frac{h_1}{h_a} + \frac{h_2}{h_b} + \frac{h_3}{h_c} = 1

Thus

l27+m27+n27=h1ha+h2hb+h3hc=1\frac{l}{27} + \frac{m}{27} + \frac{n}{27} = \frac{h_1}{h_a} + \frac{h_2}{h_b} + \frac{h_3}{h_c} = 1

We conclude that l+m+n=27l + m + n = 27. Thus every good point PP determines a partition (l,m,n)(l, m, n) of 2727 such that there are l,m,nl, m, n equal segments respectively on BC,CA,ABBC, CA, AB.

Conversely, take any partition (l,m,n)(l, m, n) of 2727. Divide BC,CA,ABBC, CA, AB respectively into l,m,nl, m, n equal parts. Define

h1=2lΔ27a,h2=2mΔ27bh_1 = \frac{2 l \Delta}{27 a}, \quad h_2 = \frac{2 m \Delta}{27 b}

Draw a line parallel to BCBC at a distance h1h_1 from BCBC; draw another line parallel to CACA at a distance h2h_2 from CACA. Both lines are drawn such that they intersect at a point PP inside the triangle ABCABC. Then

[PBC]=12ah1=lΔ27,[PCA]=mΔ27[PBC] = \frac{1}{2} a h_1 = \frac{l \Delta}{27}, \quad [PCA] = \frac{m \Delta}{27}

Hence

[PAB]=nΔ27[PAB] = \frac{n \Delta}{27}

This shows that the distance of PP from ABAB is

h3=2nΔ27ch_3 = \frac{2 n \Delta}{27 c}

Therefore each triangle with base on CACA has area Δ27\frac{\Delta}{27}. We conclude that all the triangles which partition ABCABC have equal areas. Hence PP is a good point.

Thus the number of good points is equal to the number of positive integral solutions of the equation l+m+n=27l + m + n = 27. This is equal to

(262)=325\binom{26}{2} = 325

Problem 4

Algebra Number Theory
Problem

Let f:ZZf: \mathbb{Z} \rightarrow \mathbb{Z} be a function satisfying f(0)0f(0) \neq 0, f(1)=0f(1)=0 and

(i) f(xy)+f(x)f(y)=f(x)+f(y)f(xy)+f(x)f(y)=f(x)+f(y);

(ii) (f(xy)f(0))f(x)f(y)=0(f(x-y)-f(0)) f(x) f(y)=0,

for all x,yZx, y \in \mathbb{Z}, simultaneously.

a. Find the set of all possible values of the function ff.

b. If f(10)0f(10) \neq 0 and f(2)=0f(2)=0, find the set of all integers nn such that f(n)0f(n) \neq 0.

View Solution

Setting y=0y=0 in the condition (ii), we get

(f(x)f(0))f(x)=0(f(x)-f(0)) f(x)=0

for all xx (since f(0)0f(0) \neq 0). Thus either f(x)=0f(x)=0 or f(x)=f(0)f(x)=f(0), for all xZx \in \mathbb{Z}. Now taking x=y=0x=y=0 in (i), we see that f(0)+f(0)2=2f(0)f(0)+f(0)^2=2 f(0). This shows that f(0)=0f(0)=0 or f(0)=1f(0)=1. Since f(0)0f(0) \neq 0, we must have f(0)=1f(0)=1. We conclude that

either f(x)=0 or f(x)=1 for each xZ\text{either } f(x)=0 \text{ or } f(x)=1 \text{ for each } x \in \mathbb{Z}

This shows that the set of all possible values of f(x)f(x) is {0,1}\{0,1\}. This completes (a).

Let S={nZf(n)0}S=\{n \in \mathbb{Z} \mid f(n) \neq 0\}. Hence we must have S={nZf(n)=1}S=\{n \in \mathbb{Z} \mid f(n)=1\} by (a). Since f(1)=0f(1)=0, 11 is not in SS. And f(0)=1f(0)=1 implies that 0S0 \in S. Take any xZx \in \mathbb{Z} and ySy \in S. Using (ii), we get

f(xy)+f(x)=f(x)+1f(xy)+f(x)=f(x)+1

This shows that xySxy \in S. If xZx \in \mathbb{Z} and yZy \in \mathbb{Z} are such that xySxy \in S, then (ii) gives

1+f(x)f(y)=f(x)+f(y)1+f(x)f(y)=f(x)+f(y)

Thus (f(x)1)(f(y)1)=0(f(x)-1)(f(y)-1)=0. It follows that f(x)=1f(x)=1 or f(y)=1f(y)=1; i.e., either xSx \in S or ySy \in S. We also observe from (ii) that xSx \in S and ySy \in S implies that f(xy)=1f(x-y)=1 so that xySx-y \in S. Thus SS has the properties:

(A) xZx \in \mathbb{Z} and ySy \in S implies xySxy \in S;

(B) x,yZx, y \in \mathbb{Z} and xySxy \in S implies xSx \in S or ySy \in S;

(C) x,ySx, y \in S implies xySx-y \in S.

Now we know that f(10)0f(10) \neq 0 and f(2)=0f(2)=0. Hence f(10)=1f(10)=1 and 10S10 \in S; and 2S2 \notin S. Writing 10=2×510=2 \times 5 and using (B), we conclude that 5S5 \in S and f(5)=1f(5)=1. Hence f(5k)=1f(5k)=1 for all kZk \in \mathbb{Z} by (A).

Suppose f(5k+l)=1f(5k+l)=1 for some ll, 1l41 \leq l \leq 4. Then 5k+lS5k+l \in S. Choose uZu \in \mathbb{Z} such that lu1(mod5)lu \equiv 1 \pmod{5}. We have (5k+l)uS(5k+l)u \in S by (A). Moreover, lu=1+5mlu=1+5m for some mZm \in \mathbb{Z} and

(5k+l)u=5ku+lu=5ku+5m+1=5(ku+m)+1(5k+l)u=5ku+lu=5ku+5m+1=5(ku+m)+1

This shows that 5(ku+m)+1S5(ku+m)+1 \in S. However, we know that 5(ku+m)S5(ku+m) \in S. By (C), 1S1 \in S which is a contradiction. We conclude that 5k+lS5k+l \notin S for any ll, 1l41 \leq l \leq 4. Thus

S={5kkZ}S=\{5k \mid k \in \mathbb{Z}\}

Problem 5

Geometry
Problem

Let Γ1\Gamma_{1} and Γ2\Gamma_{2} be two circles touching each other externally at RR. Let l1l_{1} be a line which is tangent to Γ2\Gamma_{2} at PP and passing through the center O1O_{1} of Γ1\Gamma_{1}. Similarly, let l2l_{2} be a line which is tangent to Γ2\Gamma_{2} at QQ and passing through the center O2O_{2} of Γ2\Gamma_{2}. Suppose l1l_{1} and l2l_{2} are not parallel and intersect at KK. If KP=KQK P = K Q, prove that the triangle PQRP Q R is equilateral.

Note

This problem originally includes a geometry diagram. The diagram is omitted in this version.

View Solution

Solution 1.

Suppose that PP and QQ lie on the opposite sides of line joining O1O_{1} and O2O_{2}. By symmetry we may assume that the configuration is as shown in the figure below. Then we have KP>KO1>KQK P > K O_{1} > K Q since KO1K O_{1} is the hypotenuse of triangle KQO1K Q O_{1}. This is a contradiction to the given assumption, and therefore PP and QQ lie on the same side of the line joining O1O_{1} and O2O_{2}. Since KP=KQK P = K Q it follows that KK lies on the radical axis of the given circles, which is the common tangent at RR. Therefore KP=KQ=KRK P = K Q = K R and hence KK is the circumcenter of PQR\triangle P Q R. On the other hand, KQO1\triangle K Q O_{1} and KRO1\triangle K R O_{1} are both right-angled triangles with KQ=KRK Q = K R and QO1=RO1Q O_{1} = R O_{1}, and hence the two triangles are congruent. Therefore QKO1^=RKO1^\widehat{Q K O_{1}} = \widehat{R K O_{1}}, so KO1K O_{1}, and hence PKP K is perpendicular to QRQ R. Similarly, QKQ K is perpendicular to PRP R, so it follows that KK is the orthocenter of PQR\triangle P Q R. Hence we have that PQR\triangle P Q R is equilateral.

View Solution

Solution 2.

We again rule out the possibility that PP and QQ are on the opposite side of the line joining O1O2O_{1} O_{2}, and assume that they are on the same side. Observe that KPO2\triangle K P O_{2} is congruent to KQO1\triangle K Q O_{1} (since KP=KQK P = K Q). Therefore O1P=O2Q=rO_{1} P = O_{2} Q = r (say). In O1O2Q\triangle O_{1} O_{2} Q, we have O1QO2^=π/2\widehat{O_{1} Q O_{2}} = \pi / 2 and RR is the midpoint of the hypotenuse, so RQ=RO1=rR Q = R O_{1} = r. Therefore O1RQ\triangle O_{1} R Q is equilateral, so QRO1^=π/3\widehat{Q R O_{1}} = \pi / 3. Similarly, PR=rP R = r and PRO2^=π/3\widehat{P R O_{2}} = \pi / 3, hence PRQ^=π/3\widehat{P R Q} = \pi / 3. Since PR=QRP R = Q R it follows that PQR\triangle P Q R is equilateral.


Problem 6

Number Theory
Problem

Find all positive integers mm, nn, and primes p5p \geq 5 such that

m(4m2+m+12)=3(pn1)m\left(4 m^{2}+m+12\right)=3\left(p^{n}-1\right)
View Solution

Rewriting the given equation we have

4m3+m2+12m+3=3pn4 m^{3}+m^{2}+12 m+3=3 p^{n}

The left hand side equals (4m+1)(m2+3)(4 m+1)\left(m^{2}+3\right). Suppose that (4m+1,m2+3)=1\left(4 m+1, m^{2}+3\right)=1. Then (4m+1,m2+3)=(3pn,1),(3,pn),(pn,3)\left(4 m+1, m^{2}+3\right)=\left(3 p^{n}, 1\right),\left(3, p^{n}\right),\left(p^{n}, 3\right) or (1,3pn)\left(1,3 p^{n}\right), a contradiction since 4m+1,m2+344 m+1, m^{2}+3 \geq 4. Therefore (4m+1,m2+3)>1\left(4 m+1, m^{2}+3\right)>1. Since 4m+14 m+1 is odd we have (4m+1,m2+3)=(4m+1,16m2+48)=(4m+1,49)=7\left(4 m+1, m^{2}+3\right)=\left(4 m+1,16 m^{2}+48\right)=(4 m+1,49)=7 or 4949. This proves that p=7p=7, and 4m+1=37k4 m+1=3 \cdot 7^{k} or 7k7^{k} for some natural number kk. If (4m+1,49)=7(4 m+1,49)=7 then we have k=1k=1 and 4m+1=214 m+1=21 which does not lead to a solution. Therefore (4m+1,m2+3)=49\left(4 m+1, m^{2}+3\right)=49. If 737^{3} divides 4m+14 m+1 then it does not divide m2+3m^{2}+3, so we get m2+3372<734m+1m^{2}+3 \leq 3 \cdot 7^{2}<7^{3} \leq 4 m+1. This implies (m2)2<2(m-2)^{2}<2, so m3m \leq 3, which does not lead to a solution. Therefore we have 4m+1=494 m+1=49 which implies m=12m=12 and n=4n=4. Thus (m,n,p)=(12,4,7)(m, n, p)=(12,4,7) is the only solution.