Problem:
Let and be integers (not necessarily positive). Prove that .
, 2016
Solution
Solution:
Since cubes are or modulo , by inspection we see that we must have for this to be possible. Thus , are divisible by . But then we get , which is a contradiction.
One can also solve the problem in the same manner by taking modulo , since all cubes are or modulo . The proof can be copied literally, noting that but .
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.