- #1
lifom
- 14
- 0
I know that any prime p = 1 mod 4 can be expressed as sum of 2 squares.
But how many different pairs of integers a,b such that p = a^2+b^2? (with a>b!)
It seems there is only one pair. How to prove it?
I try in this way: assume p = a^2+b^2 = c^2+d^2 (with a>c>d>b) and try to show it has contradiction, but I fail.
But how many different pairs of integers a,b such that p = a^2+b^2? (with a>b!)
It seems there is only one pair. How to prove it?
I try in this way: assume p = a^2+b^2 = c^2+d^2 (with a>c>d>b) and try to show it has contradiction, but I fail.