Given a positive integer , show that there exists a prime and such that one can choose distinct integers such that divides for all .
, 2021
Solution
First, construct distinct positive rational numbers such that for all . Since , are strictly increasing sequences for . Choose to be distinct primes larger than and , it is easy to see that are distinct rational numbers. Write as irreducible fractions. It is easy to see that in only if . Choose prime , then in satisfies the desired properties.
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.