Timeline for Let $p$ be a prime number with $p \equiv 3 \pmod 4$. Prove that (${p-1} \over {2}$)! $ \equiv (-1)^{n} \pmod p$
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 9, 2016 at 21:38 | history | edited | Matthew Conroy | CC BY-SA 3.0 | removed extraneous > |
| Nov 9, 2016 at 21:19 | answer | added | Rene Schipperus | timeline score: 0 | |
| Nov 9, 2016 at 20:18 | history | asked | DERPYPENGUIN | CC BY-SA 3.0 |