Timeline for Computing factorials modulo p^N
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 24, 2018 at 22:02 | comment | added | metamorphy | May be relevant. | |
| Mar 26, 2011 at 11:32 | answer | added | Remke Kloosterman | timeline score: 12 | |
| Mar 25, 2011 at 22:00 | answer | added | Gerry Myerson | timeline score: 5 | |
| Mar 25, 2011 at 20:11 | comment | added | Daniel Litt | For $(p-1)!$ modulo $p$: Wilson's theorem and Primes is in P? | |
| Mar 25, 2011 at 19:53 | comment | added | Michael Lugo | How do you compute $(p-1)!$ modulo $p$ in time $\log p$? | |
| Mar 25, 2011 at 19:27 | history | asked | John Voight | CC BY-SA 2.5 |