Timeline for Is $2^{p}-1$ prime iff for $\frac{p-1}{2}$ odd positive integers $n$ below $p$, $(n+2)\vert (2^{p}+n)$?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2013 at 23:08 | vote | accept | Sylvain JULIEN | ||
| Nov 10, 2013 at 23:07 | review | Low quality posts | |||
| Nov 10, 2013 at 23:12 | |||||
| Nov 10, 2013 at 22:57 | comment | added | Gerry Myerson | @Stefan, I'm not surprised. I didn't check systematically, I just guessed that 19 would be big enough to fail and small enough to test with little effort. | |
| Nov 10, 2013 at 22:55 | comment | added | Stefan Kohl♦ | 2^17-1 is an even smaller counterexample. | |
| Nov 10, 2013 at 22:51 | history | answered | Gerry Myerson | CC BY-SA 3.0 |