Timeline for Chebyshev polynomials of the first kind and primality testing
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2021 at 16:41 | history | edited | Max Alekseyev | CC BY-SA 4.0 |
deleted 43 characters in body
|
| Oct 2, 2021 at 14:00 | history | edited | Max Alekseyev | CC BY-SA 4.0 |
deleted 32 characters in body; added 9 characters in body
|
| Oct 2, 2021 at 13:53 | comment | added | Max Alekseyev | @Mastrem: Thanks for checking this. I've corrected the congruences and added a Sage code that computes them. | |
| Oct 2, 2021 at 13:52 | history | edited | Max Alekseyev | CC BY-SA 4.0 |
added 862 characters in body
|
| Oct 2, 2021 at 9:17 | comment | added | Mastrem | I know this is an old answer, but are you sure about those congruences for $p=3$? I believe the modulus is $410$, not $625$. Note for example that $T_{628}\not\equiv x^{628}\pmod {x^5-1,3}$. | |
| Jun 6, 2020 at 14:54 | comment | added | Simd | That's really exciting if this is still potentially the fastest primality testing algorithm. | |
| Jun 6, 2020 at 14:53 | comment | added | Max Alekseyev | @Anush: No, but I did not search much. | |
| Jun 6, 2020 at 4:47 | comment | added | Simd | Have any pseudoprimes been found? | |
| Nov 27, 2019 at 20:17 | history | edited | Max Alekseyev | CC BY-SA 4.0 |
edited body; added 6 characters in body
|
| Nov 27, 2019 at 20:08 | history | answered | Max Alekseyev | CC BY-SA 4.0 |