Problem:
Let be a complex number with integer real and imaginary parts , where (i.e. is a Gaussian integer). If is an odd prime number, show that the real part of is an integer divisible by .
, 2015
Solution
Solution:
We directly compute/expand
Since is divisible by for all (since ), we have
by Fermat's little theorem. Thus divides the real part of .
Solution 2:
From the Frobenius endomorphism,
where we're using congruence of Gaussian integers (so that if and only if is a Gaussian integer). This is equivalent to the simultaneous congruence of the real and imaginary parts modulo , so the real part of is congruent to , the real part of . So indeed divides the real part of .
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.