Number of ways to write a prime $p \equiv 1 \bmod 4$ as a sum of two squares

129 Views Asked by At

My intuition, from checking many cases, is that there is only ONE way to write a prime $p \equiv 1 \bmod 4$ as a sum of two squares. But how can I formally show this?