Note on representing a prime as a sum of two squares
1972; American Mathematical Society; Volume: 26; Issue: 120 Linguagem: Inglês
10.1090/s0025-5718-1972-0314745-6
ISSN1088-6842
Autores Tópico(s)Coding theory and cryptography
ResumoAn improvement is given to the method of Hermite for finding a a and b b in p = a 2 + b 2 p = {a^2} + {b^2} , where p p is a prime ≡ 1 ( mod 4 ) {\text {prime}} \equiv 1\pmod 4 .
Referência(s)