Number theoryDifficulty 6.0National OlympiadProve itHungary
Prove that for any integers k>10 and n>k4, among the integers (n+12), (n+22), (n+32), …, (n+k2), there is at least one that has a prime divisor greater than k.
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.