Given:
is an odd prime number.
and are positive integers.
.
Then we can always find some and such that can be expressed as
True or False ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There's a lot of general theory here. Firstly, the Gaussian integers Z [ i ] form a Euclidean domain. Since p = 4 m + 1 is prime, we note that [ ( 2 m ) ! ] 2 ≡ ( 2 m ) ! j = 1 ∏ 2 m ( p − j ) ≡ ( 2 m ) ! j = 2 m + 1 ∏ 4 m j ≡ ( 4 m ) ! ≡ ( p − 1 ) ! ≡ − 1 ( m o d p ) by Wilson's Theorem. Thus we deduce that p divides ( ( 2 m ) ! + i ) ( ( 2 m ) ! − i ) in Z [ i ] , but p divides neither ( 2 m ) ! + i nor ( 2 m ) ! − i . Thus p is not prime in Z [ i ] and hence (since we are in a Euclidean domain), p is not irreducible in Z [ i ] . Thus we can find u , v ∈ Z [ i ] such that neither u nor v is a unit and p = u v . But then p 2 = ∣ u ∣ 2 ∣ v ∣ 2 and since ∣ u ∣ 2 and ∣ v ∣ 2 are both integers greater than 1 ( u , v are not units) we deduce that ∣ u ∣ 2 = ∣ v ∣ 2 = p . If u = x + i y for integers x , y , we deduce that p = x 2 + y 2 , as required.