Let be distinct primes such that is divisible by 30. Find the minimum possible value of .
Solution
The key is to realize none of the primes can be 2,3, or 5, or else we would have to use one of them twice. Hence must lie among . These options give remainders of (obviously), modulo 3, and modulo 5. We automatically have , and we have if and only if , i.e. there are an even number of 's among . If , then we cannot have , or else is a quadratic residue. Our next smallest choice (in terms of ) is , which works: . This gives an answer of .
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.