Proof. For n≥25, write 52t≤n<52t+2 for t∈N∗. Take the set
A={(α2t,…,α1)5∣α2i∈{0,1,2,3,4} and α2i−1∈{1,3} for i=1,…,t},
where (α2t,…,α1)5 denotes the number m=52t−1α2t+⋯+5α2+α1 in quinary. It is obvious that A⊂{1,2,…,n}.
For each pair of integers u1,u2∈A, write u1=(a2t,…,a1) and u2=(b2t,…,b1). We may assume u1>u2 and consider u1−u2. Now let s be the minimal index such that as=bs. Namely, we have a1=b1,…,as−1=bs−1,as=bs. Note that in this case, u1−u2=(a2t−b2t)52t−1+⋯+(as−bs)5s−1.
If 2∣s, then 5s−1∣(u1−u2) i.e., as−bs=0 and −4≤as−bs≤4. Hence u1−u2 cannot be a perfect square.
If 2∤s, then 5s−1u1−u2=(a2t−b2t)52t−1+⋯+(as−bs)∈Z. Suppose that u1−u2 is a perfect square, then 5s−1u1−u2 is a perfect square as well. On the other hand, the condition 2∣s−1 and as=bs implies that {as,bs}={1,3} and 5s−1u1−u2≡2,3(mod5), which can never be a perfect square. This is a contradiction.
Thus for any distinct element u1,u2∈A, the number ∣u1−u2∣ is not a perfect square. Hence A satisfies the requirement. Also, note that ∣A∣=10t. Since α=log2510>1/2, we obtain
nα<5(2t+2)log2510=10t+1=10∣A∣.
So it suffices to take C=241 and α=log2510∈(0,1). As for n≤24, we may take A={1} and then ∣A∣≥241n≥241nα.
To sum up, for all n∈N∗, one can find a desired subset A with ∣A∣≥Cnα.