Olympiad Maths Prep

Library / /4 of 15

Combinatorics Difficulty 5.1 AIME, harder Prove it Ukraine

You are given some positive integer nn. Prove that for any real numbers a1,a2,...,ana_1, a_2, ..., a_n there exists some number of form k2k\sqrt{2}, where kk is some positive integer, that all numbers k2+a1,k2+a2,...,k2+ank\sqrt{2} + a_1, k\sqrt{2} + a_2, ..., k\sqrt{2} + a_n are irrational.

Solution

Consider numbers x1=2,x2=22,...,xn+1=(n+1)2x_1 = \sqrt{2}, x_2 = 2\sqrt{2}, ..., x_{n+1} = (n + 1)\sqrt{2}. Suppose that for each k=1,n+1k = 1, n + 1 at least one of the numbers xk+a1,xk+a2,...,xk+anx_k + a_1, x_k + a_2, ..., x_k + a_n is rational. As we have nn numbers, and try n+1n + 1 options, from the Dirichlet principle some two numbers of form xi+aix_i + a_i and xj+ajx_j + a_j will be rational. But then their difference also will be rational, so the number
(xj+ai)(xi+aj)=xjxi=(ji)2 (x_j + a_i) - (x_i + a_j) = x_j - x_i = (j - i)\sqrt{2}
will be rational, which isn't true. This contradiction finishes the proof, as for some xk=k2x_k = k\sqrt{2} all integers xk+a1,xk+a2,...,xk+anx_k + a_1, x_k + a_2, ..., x_k + a_n are irrational.

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.