Timeline for Primality test for numbers of the form $4k+3$
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2020 at 15:37 | history | edited | Pedja | CC BY-SA 4.0 |
Added new upper bound for verified n
|
| Oct 27, 2020 at 3:17 | vote | accept | Pedja | ||
| Dec 15, 2020 at 17:24 | |||||
| Oct 26, 2020 at 20:39 | answer | added | Max Alekseyev | timeline score: 8 | |
| Oct 25, 2020 at 15:26 | comment | added | Emil Jeřábek | Ok, thanks. Then I expect the original claim not to work either. | |
| Oct 25, 2020 at 12:17 | comment | added | Pedja | @EmilJeřábek No,it doesn't work...for $c=-1$ the smallest counterexample is $2047$. See here | |
| Oct 25, 2020 at 12:04 | comment | added | Emil Jeřábek | Is there any reason to expect that $c$'s being smallest plays any role? If I drop that condition, I can take, say, an odd prime $c$ congruent to $-1$ mod $n$ by Dirichlet's theorem. So, does the test work if I just take $c=-1$? | |
| Oct 25, 2020 at 10:18 | comment | added | Wojowu | One implication is easy: if $n$ is prime, then in $\mathbb Z[i]$ we have $(c+i)^n\equiv c^n+i^n\equiv c-i\pmod n$. | |
| Oct 25, 2020 at 8:32 | history | edited | Wlod AA | CC BY-SA 4.0 |
a superfluous "odd"
|
| Oct 25, 2020 at 5:25 | history | asked | Pedja | CC BY-SA 4.0 |