Timeline for A primality criterion for specific class of $N=4kp^n+1$
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 14 at 9:19 | comment | added | Fedor Petrov | It is rather standard, for such tests, to prove that if $N$ is prime then it divides $S_n$, but the opposite direction looks difficult, and possibly even not true. Say, if $N$ is Carmichael number plus some other restrictions, it is a counterexample. | |
| Sep 14 at 7:06 | history | edited | Pedja | CC BY-SA 4.0 |
reformulated criterion
|
| Sep 30, 2020 at 15:46 | history | edited | Pedja | CC BY-SA 4.0 |
extended upper bound for tested values of p
|
| Sep 8, 2020 at 4:33 | comment | added | Pedja | @MiloMoses This was inspired by Lucas-Lehmer-Riesel test. | |
| Sep 8, 2020 at 4:30 | comment | added | Milo Moses | How did you come up with this conjecture? | |
| Sep 8, 2020 at 4:22 | history | asked | Pedja | CC BY-SA 4.0 |