Maths Olympiad Prep

Library / /2 of 8

, 2022

Number theory Difficulty 8.0 National olympiad, round 2 Prove it China

Prove that there exist two positive real numbers CC and α>12\alpha > \frac{1}{2}, such that, for any positive integer nn, there is a subset AA of {1,2,,n}\{1, 2, \dots, n\} with ACnα|A| \ge Cn^\alpha, such that the difference between any pair of different numbers in AA is not a perfect square.

Solution

Proof. For n25n \ge 25, write 52tn<52t+25^{2t} \le n < 5^{2t+2} for tNt \in \mathbb{N}^*. Take the set
A={(α2t,,α1)5α2i{0,1,2,3,4} and α2i1{1,3} for i=1,,t}, A = \{(\alpha_{2t}, \dots, \alpha_1)_5 \mid \alpha_{2i} \in \{0, 1, 2, 3, 4\} \text{ and } \alpha_{2i-1} \in \{1, 3\} \text{ for } i = 1, \dots, t\},
where (α2t,,α1)5(\alpha_{2t}, \dots, \alpha_1)_5 denotes the number m=52t1α2t++5α2+α1m = 5^{2t-1}\alpha_{2t} + \dots + 5\alpha_2 + \alpha_1 in quinary. It is obvious that A{1,2,,n}A \subset \{1, 2, \dots, n\}.
For each pair of integers u1,u2Au_1, u_2 \in A, write u1=(a2t,,a1)u_1 = (a_{2t}, \dots, a_1) and u2=(b2t,,b1)u_2 = (b_{2t}, \dots, b_1). We may assume u1>u2u_1 > u_2 and consider u1u2u_1 - u_2. Now let ss be the minimal index such that asbsa_s \ne b_s. Namely, we have a1=b1,,as1=bs1,asbsa_1 = b_1, \dots, a_{s-1} = b_{s-1}, a_s \ne b_s. Note that in this case, u1u2=(a2tb2t)52t1++(asbs)5s1u_1 - u_2 = (a_{2t} - b_{2t})5^{2t-1} + \dots + (a_s - b_s)5^{s-1}.
If 2s2 \mid s, then 5s1(u1u2)5^{s-1} \mid (u_1 - u_2) i.e., asbs0a_s - b_s \ne 0 and 4asbs4-4 \le a_s - b_s \le 4. Hence u1u2u_1 - u_2 cannot be a perfect square.
If 2s2 \nmid s, then u1u25s1=(a2tb2t)52t1++(asbs)Z\frac{u_1 - u_2}{5^{s-1}} = (a_{2t} - b_{2t})5^{2t-1} + \dots + (a_s - b_s) \in \mathbb{Z}. Suppose that u1u2u_1 - u_2 is a perfect square, then u1u25s1\frac{u_1 - u_2}{5^{s-1}} is a perfect square as well. On the other hand, the condition 2s12 \mid s - 1 and asbsa_s \ne b_s implies that {as,bs}={1,3}\{a_s, b_s\} = \{1, 3\} and u1u25s12,3(mod5)\frac{u_1 - u_2}{5^{s-1}} \equiv 2, 3 \pmod 5, which can never be a perfect square. This is a contradiction.
Thus for any distinct element u1,u2Au_1, u_2 \in A, the number u1u2|u_1 - u_2| is not a perfect square. Hence AA satisfies the requirement. Also, note that A=10t|A| = 10^t. Since α=log2510>1/2\alpha = \log_{25} 10 > 1/2, we obtain
nα<5(2t+2)log2510=10t+1=10A. n^\alpha < 5^{(2t+2)\log_{25} 10} = 10^{t+1} = 10|A|.
So it suffices to take C=124C = \frac{1}{24} and α=log2510(0,1)\alpha = \log_{25} 10 \in (0, 1). As for n24n \le 24, we may take A={1}A = \{1\} and then A124n124nα|A| \ge \frac{1}{24}n \ge \frac{1}{24}n^\alpha.
To sum up, for all nNn \in \mathbb{N}^*, one can find a desired subset AA with ACnα|A| \ge Cn^\alpha.

Want a route through all this instead of 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.