Timeline for C++ Prime Number Library
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 22, 2016 at 20:43 | comment | added | DanaJ | Dannnno has lots of good comments. In terms of optimizations, this is the sort of thing that never really ends. After some of the obvious things like removing redundant work, using better algorithms will help. SoE is much faster than SoA. There are much faster primality tests vs. generating primes, similarly with counting. The clusters (twin,sexy,etc.) only appear in some remainders modulo a primorial so can be optimized. Once past tiny sizes, there are much faster factoring methods than trial division. | |
| Jul 1, 2016 at 1:37 | vote | accept | InversePalindrome | ||
| Jun 30, 2016 at 23:32 | answer | added | Dan Oberlam | timeline score: 4 | |
| Jun 30, 2016 at 19:18 | review | First posts | |||
| Jun 30, 2016 at 20:00 | |||||
| Jun 30, 2016 at 19:08 | history | asked | InversePalindrome | CC BY-SA 3.0 |