ガウス整数
1. First proof. If formula_29 is an odd prime number, then we have formula_211 in the Gaussian integers. Consequently, writing a Gaussian integer ω = "x" + "iy" with "x,y" ∈ Z and applying the Frobenius automorphism in Z["i"]/("p"), one finds