Timeline for If $\binom{2p}{p}$ is $(-1)^{p-1} \bmod 2p+1$ is then $2p+1$ prime?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 13, 2015 at 4:56 | comment | added | The Masked Avenger | You can do it by hand, but it would take a while. Factor 2*2953 + 1 as 3 * 11 * 179, and consider those terms which are multiples of 3 or 11 or 179 separately. Or as Robert Israel commented, work modulo each prime. | |
| Jun 13, 2015 at 2:43 | comment | added | Destiny freedom | can you prove $(2953\times 2+1)|\binom{2\cdot 2953}{2953}+1$ by hand? | |
| Jun 13, 2015 at 2:26 | history | answered | Robert Israel | CC BY-SA 3.0 |