If
Proof.
□
A prime
Proof.
□
let
The the congruenc
admits a solution
Proof.
consider the set
Note that
Pigeonhole PrinciplePigeonhole Principle implies that
take,
Note:
□
An odd prime
Proof.
“only if” part is done in 2. Sum of Two Squares > ^8e78122. Sum of Two Squares > Theorem 2.2
let
Please help me again
In fact, we can take
Note that
□
Proof.
lets assume W.L.O.G
Then
similarly we can show
if we chose
hence They are unique
□
let the positive integers n be written as
Proof.
Suppose
Let
Each of the prime
which implies there product
The other way.
Suppose,
assume that
let
This gives
since
since
we can find