Maths Olympiad Prep

Library / /49 of 151

, 2026

Number theory Difficulty 6.0 National Olympiad Prove it Hungary

Prove that for any integers k>10k>10 and n>k4n>k^4, among the integers (n+12)({n+1^2}), (n+22)({n+2^2}), (n+32)({n+3^2}), \ldots, (n+k2)({n+k^2}), there is at least one that has a prime divisor greater than kk.

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.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.