Prove that for every positive integer , one can find three pairwise coprime positive integers such that the set of prime divisors of and are the same.
Iranian Mathematical Olympiad
Solution
We seek for large enough positive integers such that for some positive integer . Indeed, one can write . Now, choose such that that is, then we need to find such that . Choose coprime such that doesn't divide it follows that . Further, choosing implies that divides also . The rest is clear.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.