IMC 2007, Day 2, Problem 2
Let , , and be integers such that is divisible by . Show that is divisible by .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. We claim that . Then, is clearly divisible by .
Assume, to the contrary, that 29 does not divide all of the numbers . Without loss of generality, we can suppose that . Since the residue classes modulo 29 form a field, there is some such that . Then, is also divisible by 29. So we can assume that .
Thus, we need to show that , i.e. , is impossible. There are only eight fourth powers modulo 29,
Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.