Maths Olympiad Prep

Library / HMMT February /782 of 1302

HMMT February, 2015

Number theory Difficulty 5.3 AIME, harder Prove it United States

Problem:
Let z=a+biz = a + b i be a complex number with integer real and imaginary parts a,b∈Za, b \in \mathbb{Z}, where i=−1i = \sqrt{-1} (i.e. zz is a Gaussian integer). If pp is an odd prime number, show that the real part of zp−zz^{p} - z is an integer divisible by pp.

Solution

Solution:
We directly compute/expand
Re⁡(zp−z)=Re⁡((a+bi)p−(a+bi))=[ap−(p2)ap−2b2+(p4)ap−4b4−⋯ ]−a. \begin{aligned} \operatorname{Re}\left(z^{p}-z\right) & = \operatorname{Re}\left((a+b i)^{p}-(a+b i)\right) \\ & = \left[a^{p} - \binom{p}{2} a^{p-2} b^{2} + \binom{p}{4} a^{p-4} b^{4} - \cdots \right] - a . \end{aligned}
Since (pi)\binom{p}{i} is divisible by pp for all i=2,4,6,…i=2,4,6, \ldots (since 1≤i≤p−11 \leq i \leq p-1), we have
[ap−(p2)ap−2b2+(p4)ap−4b4−⋯ ]−a≡ap−a≡0( mod p) \left[a^{p} - \binom{p}{2} a^{p-2} b^{2} + \binom{p}{4} a^{p-4} b^{4} - \cdots \right] - a \equiv a^{p} - a \equiv 0 \quad (\bmod p)
by Fermat's little theorem. Thus pp divides the real part of zp−zz^{p}-z.

Solution 2:
From the Frobenius endomorphism,
zp=(a+bi)p≡ap+(bi)p=ap±bpi≡a±bi( mod p⋅Z∗) z^{p} = (a + b i)^{p} \equiv a^{p} + (b i)^{p} = a^{p} \pm b^{p} i \equiv a \pm b i \quad (\bmod p \cdot \mathbb{Z}*)
where we're using congruence of Gaussian integers (so that u≡v( mod p)u \equiv v (\bmod p) if and only if u−vp\frac{u-v}{p} is a Gaussian integer). This is equivalent to the simultaneous congruence of the real and imaginary parts modulo pp, so the real part of zpz^{p} is congruent to aa, the real part of zz. So indeed pp divides the real part of zp−zz^{p}-z.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.