The mathematician, Fermat, said that any primeof the form
can be expressed as a sum of two squares. However, it turns out amazingly, that this representation is also unique. Accept by faith the existence of Fermat's theorem and prove uniqueness.
The mathematician, Fermat, said that any primeof the form
can be expressed as a sum of two squares. However, it turns out amazingly, that this representation is also unique. Accept by faith the existence of Fermat's theorem and prove uniqueness.
I think I have got a solution, but's its also prooving the existence of the two numbers : no acceptation by faith!
would it fit?
(i hope not, because i feel lazy and though it's not very long it's a little tricky because it's involving the distinction betwenn numbers and their 'correspondant' modulo 4k+1=p')![]()
Say that.
Note that.
Thus,
.
Our goal now is to show either. Now
follows at once from the equation
. But if
we will show this implies that
.
Now ifthen
. Thus,
.
Now we have established that.
Say the first one is true. Then
. But since
. Say therefore that
. Substitute
into
we get
. But then
.
Now using a similar argument withwe find that
.
I hope you like this proof. I really find it beautiful how divisibility arguments lead us to this conclusion.