Indian National Mathematical Olympiad 2017. 6 problems. Problems sourced from MathNet (CC BY 4.0). Solutions are expert-authored.
Problem 1
Let be a set of real numbers such that has at least four elements. Suppose has the property that is a rational number for all distinct numbers in . Prove that there exists a positive integer such that is a rational number for every in .
View Solution
Suppose . Then is rational and is also rational for all in , , , . Hence for some rational and natural number . For any , we have
which is a rational number. Hence we may assume is not in . If there is a number in such that is also in , then again we can get the conclusion as follows. Consider two other elements in . Then is rational and is also rational. It follows that is rational and is rational. Similarly, and are also rationals. Thus is rational. Note that we can vary over with and . Again is rational implies that for some rational and natural number . We observe that is rational, and
so that is a rational number. Similarly is the case with . For any other element ,
is a rational number. Thus we may now assume that is not in and for any in . Let be four distinct elements of . We may assume . Then and are rational numbers and so is their difference . Writing , and using the facts , are rationals, we conclude that is also a rational number. Similarly, is also a rational number. Consider
Note that . Thus is a rational number and . This gives . Let us take . Then
where and are natural numbers. Take . Then is a rational number. Finally, for any in , we have
is also a rational number.
Problem 2
All the points with integer coordinates in the -plane are coloured using three colours, red, blue and green, each colour being used at least once. It is known that the point is coloured red and the point is coloured blue. Prove that there exist three points with integer coordinates of distinct colours which form the vertices of a right-angled triangle.
This problem originally includes a geometry diagram. The diagram is omitted in this version.
View Solution
Consider the lattice points (points with integer coordinates) on the lines and , other than and . If one of them, say , is coloured green, then we have a right-angled triangle with , and as vertices, all having different colours. (See Figures 1 and 2.)
If not, the lattice points on and are all red or blue. We consider three different cases.
Case 1. Suppose a point is blue. Consider a green point in the plane. Suppose . If its projection on the -axis is red, then , and are the vertices of a required type of right-angled triangle. If is blue, then we can consider the triangle whose vertices are , and . If , then the points , and will work. (Figure 3.)
Case 2. A point , on the line , is red. A similar argument works in this case.
Fig-4
Case 3. Suppose all the lattice points on the line are red and all on the line are blue points. Consider a green point , where and . (See Figure 4.) Consider an isosceles right-angled triangle with such that the hypotenuse is a part of the -axis. Let intersect in . Then is a red point and is a blue point. Hence is a desired triangle.
Problem 3
Let be a given polynomial with integer coefficients. Prove that there exist two polynomials and , again with integer coefficients, such that (i) is a polynomial in ; and (ii) is a polynomial in .
View Solution
Let be a polynomial with integer coefficients.
Part (i) We may write
Define
Then is also a polynomial with integer coefficients and
is a polynomial in .
Part (ii) We write again
where
Note that and are polynomials with integer coefficients and each of these is a polynomial in . We may introduce
where is an imaginary cube-root of unity. Then
since and . Taking , we obtain
which is a polynomial in . This follows from the identity
Alternately, may be directly defined by
Problem 4
Let be a triangle with circumcircle . Let be a point in the interior of triangle which is also on the bisector of . Let , , meet in , , respectively. Suppose is the point of intersection of with ; and is the point of intersection of with . Prove that is parallel to .
This problem originally includes a geometry diagram. The diagram is omitted in this version.
View Solution
Let . Then . Thus
We also have , say. It follows that triangles and are similar and hence
Similarly, triangles and are similar and we get
Using the point , we get similar ratios:
Thus,
and
However, triangles and are similar, which gives
Putting this in the last expression, we get
We conclude that is parallel to .
Problem 5
Find all natural numbers such that does not divide .
View Solution
Suppose , where are primes and . Then , and , not necessarily a prime. Thus we have
Observe that are all distinct. Hence their product divides . Thus divides in this case. We conclude that either where are distinct primes or for some prime .
Case 1. Suppose for some primes , where . Then and . In this case
Thus are all distinct numbers in the set . We see that divides . We conclude that for some prime . Note that in this case so that does not divide .
Case 2. Suppose for some prime . We observe that all lie in the set . If , then there are at least multiples of in the set . Hence divides . Thus .
If , then , which may be proved by an easy induction. Hence . If , we get , a prime. If , then so that or ; we get or . For , we have giving ; in this case. Finally, gives . Again and . However divides and hence is not a solution.
Thus for some prime or . It is easy to verify that these satisfy the conditions of the problem.
Problem 6
Find all non-zero real numbers which satisfy the system of equations:
View Solution
Since , we can divide the second relation by the first. Observe that
holds for any . Thus we get
However, for any real numbers , we have
Since , we get
This is possible only if
hold simultaneously. However . If , then giving . Since we are looking for nonzero , we conclude that which is same as . Using the other two relations, we also get and . The first equation now gives . This gives (since ), or . We thus have . These also satisfy the second relation, as may be verified.