Timeline for Are there natural choices of $\sqrt{-1}$ in $\mathbb Z/p\mathbb Z$ for a prime $p\equiv 1\pmod 4$
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2010 at 2:33 | comment | added | Victor Protsak | Almost any book discussing algorithms in number theory, e.g. Bach-de Shalit or H.Cohen "Course", which also gives Cornacchia's algorithm for solving $a^2+db^2=p$ that starts with finding $\sqrt{-d}\ \mod p.$ | |
| Jun 21, 2010 at 21:41 | comment | added | David Carchedi | Cool, do you have the reference? I'm just curious. I can't contribute any of what I posted to anyone because I cooked it up myself, but I was pretty sure it was not original. | |
| Jun 21, 2010 at 21:10 | comment | added | Victor Protsak | The algorithm for square roots $\mod p$ is due to Tonelli (1891). When $p\equiv 5(\mod 8)$, there is still a natural choice of a quadratic non-residue, namely, $y=2.$ | |
| Jun 21, 2010 at 17:09 | history | edited | David Carchedi | CC BY-SA 2.5 |
added 112 characters in body
|
| Jun 21, 2010 at 16:59 | history | edited | David Carchedi | CC BY-SA 2.5 |
added details
|
| Jun 21, 2010 at 15:34 | history | answered | David Carchedi | CC BY-SA 2.5 |