Timeline for Matrix sieve algorithm for finding prime numbers
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2021 at 18:12 | answer | added | user140242 | timeline score: 1 | |
| Jan 7, 2020 at 17:27 | comment | added | Boris Sklyar | Theoretical background and C++ code - see academia.edu/13890086/… program calculates primes in interval of 10^6 for numbers up to 10^19 for run time of 10 sec | |
| Jan 7, 2020 at 17:21 | comment | added | Gerhard Paseman | Assuming the assertions are formally proved correct, it would seem then to be an alternative. Even so, it is unclear to me what benefits there are. Can you use it to test for a prime quickly? Can you say something new about the distribution of primes with it? Until you are able to convince me of its potential, I will focus on my own prime finding algorithms. Gerhard "Not Sure Of The Applicability" Paseman, 2020.01.07. | |
| Jan 7, 2020 at 15:58 | history | asked | Boris Sklyar | CC BY-SA 4.0 |