Timeline for Is $p$ is square modulo $F_p$ when $p=4k+1 > 5$?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8, 2014 at 15:05 | vote | accept | joro | ||
| Nov 7, 2014 at 15:19 | comment | added | joro | Your approach appears to numerically agree with Brent's even for p=4k+3. | |
| Nov 7, 2014 at 13:18 | history | answered | Jeremy Rouse | CC BY-SA 3.0 |