MathLabs

Problem 2

Let a1,a2,a3,…a_1, a_2, a_3, \ldots be an infinite increasing sequence of positive integers. Prove that for every p≥1p \ge 1 there are infinitely many ama_m which can be written in the form am=xap+yaqa_m = xa_p + ya_q with x,yx, y positive integers and q>pq > p.
Step 4 of 4: Conclude: infinitely many representable terms
{aik}k≥2 infinite  ⟹  infinitely many am=xap+yaq\{a_{i_k}\}_{k\ge 2} \text{ infinite} \implies \text{infinitely many } a_m=xa_p+ya_q
Detailed analysis

Step 3 applies to every k≥2k \ge 2, and the subsequence (aik)k≥1(a_{i_k})_{k \ge 1} is infinite, so there are infinitely many indices m=ikm = i_k (k≥2k \ge 2) for which am=xap+yaqa_m = xa_p + ya_q with positive integers x,yx, y and q=i1>pq = i_1 > p. Since p≥1p \ge 1 was arbitrary, this holds for every pp, which is exactly the statement to be proved. ■\blacksquare