Maths Olympiad Prep

Library / /3 of 16

Number theory Difficulty 5.2 AIME, harder Prove it Romania

A sequence of positive integers is called complete if any positive integer has a multiple in the sequence. Prove that an arithmetic sequence of positive integers is complete if and only if its difference divides the first term.

Solution

If the difference rr divides a1a_1, then a1=dra_1 = dr, dNd \in \mathbb{N} and an=(d+n1)ra_n = (d + n - 1)r, and a multiple of a positive integer kk is obtained when d+n1d + n - 1 is a multiple of kk.

For the converse, observe first that if r=0r = 0, the sequence is not complete. Because r0r \neq 0 and by the assumption there is a multiple of rr of the form a1+(n1)ra_1 + (n-1)r, with nNn \in \mathbb{N}^*, we conclude ra1r \mid a_1.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.