Library / /44 of 60
, 2025
Number theory Difficulty 6.0 National Olympiad Prove it United Kingdom
Let p be a prime number, and let n be the smallest positive integer, strictly greater than 1, for which n6−1 is divisible by p.
Prove that at least one of (n+1)6−1 and (n+2)6−1 is divisible by p.
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: UK Mathematics Trust,
licensed © UK Mathematics Trust; question papers published free at bmos.ukmt.org.uk.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.