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 divides , then , and , and a multiple of a positive integer is obtained when is a multiple of .
For the converse, observe first that if , the sequence is not complete. Because and by the assumption there is a multiple of of the form , with , we conclude .
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.