Confusion? II

Given:

  • p p is an odd prime number.

  • x x and y y are positive integers.

  • p 1 ( m o d 4 ) p\equiv 1\pmod 4 .

Then we can always find some x x and y y such that p p can be expressed as p = x 2 + y 2 p=x^2+y^2

True or False ?

Can not be determined True 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.

1 solution

Mark Hennings
Feb 14, 2020

There's a lot of general theory here. Firstly, the Gaussian integers Z [ i ] \mathbb{Z}[i] form a Euclidean domain. Since p = 4 m + 1 p = 4m+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 ) [(2m)!]^2 \; \equiv \; (2m)!\prod_{j=1}^{2m}(p - j) \; \equiv \; (2m)! \prod_{j=2m+1}^{4m}j \; \equiv \; (4m)! \; \equiv \; (p-1)! \; \equiv \; -1 \pmod{p} by Wilson's Theorem. Thus we deduce that p p divides ( ( 2 m ) ! + i ) ( ( 2 m ) ! i ) \big((2m)! + i\big)\big((2m)! - i\big) in Z [ i ] \mathbb{Z}[i] , but p p divides neither ( 2 m ) ! + i (2m)! + i nor ( 2 m ) ! i (2m)! - i . Thus p p is not prime in Z [ i ] \mathbb{Z}[i] and hence (since we are in a Euclidean domain), p p is not irreducible in Z [ i ] \mathbb{Z}[i] . Thus we can find u , v Z [ i ] u,v \in \mathbb{Z}[i] such that neither u u nor v v is a unit and p = u v p = uv . But then p 2 = u 2 v 2 p^2 = |u|^2|v|^2 and since u 2 |u|^2 and v 2 |v|^2 are both integers greater than 1 1 ( u , v u,v are not units) we deduce that u 2 = v 2 = p |u|^2=|v|^2=p . If u = x + i y u=x+iy for integers x , y x,y , we deduce that p = x 2 + y 2 p = x^2+y^2 , as required.

This is what I wanted. Thanks.

A Former Brilliant Member - 1 year, 3 months ago

This problem is conditioned poorly. It should indicate that the choice of x x and y y depends on p p . But that's not how it's written.

The way it's written is that we are told that p p is a prime number congruent to 1 m o d 4 1 \mod 4 and that x x and y y are positive integers. And the conclusion is that p = x 2 + y 2 p = x^2 + y^2 . Clearly this is wrong. The implication would be that, for any pair of positive integers x x and y y , p = x 2 + y 2 p = x^2 + y^2 . Worse, it would imply that x 2 + y 2 x^2 + y^2 is constant over pairs of positive integers.

Richard Desper - 1 year, 3 months ago

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...