Timeline for Primes and multi-threading
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2021 at 15:49 | comment | added | BobDalgleish | A quick Google search comes up with arxiv.org/abs/1712.09130 | |
| Oct 11, 2021 at 13:54 | comment | added | gnasher729 | What’s is name, that’s for large numbers. And for checking individual primes. It would be useless to find all primes from 10^15 to 10^15 + 10^10, for example. Which a sieve handles just fine. (Less in a minute if you don’t try hard at all). | |
| Oct 11, 2021 at 4:46 | comment | added | whatsisname | @gnasher729: example en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test though probabilistic, you can run it multiple times with different values to get an acceptable probability of primality. There are others likely linked in that article. | |
| Oct 10, 2021 at 15:07 | comment | added | gnasher729 | @BobDalgleish, that's interesting. Could you give some reference for this? | |
| Oct 8, 2021 at 16:16 | comment | added | BobDalgleish | There are a number of algorithms which are substantially faster than the Sieve of Eratosthenes. Some are at least an order of magnitude faster. However, the main blockage would be how you represent integers. | |
| Oct 8, 2021 at 14:35 | answer | added | Kind Contributor | timeline score: 2 | |
| Oct 8, 2021 at 14:22 | comment | added | Kind Contributor | @OldCurmudgeon That link looks like it's only about Fibonacci. | |
| Apr 2, 2014 at 9:22 | comment | added | Thomas Ayoub | @OldCurmudgeon I'll take a look and hope it'll fit with C++, thanks. | |
| Apr 2, 2014 at 8:58 | comment | added | OldCurmudgeon | There's an excellent article here covering several techniques for multi-threading prime calculation. | |
| Apr 2, 2014 at 8:14 | review | First posts | |||
| Apr 2, 2014 at 8:15 | |||||
| Apr 2, 2014 at 7:55 | history | asked | Thomas Ayoub | CC BY-SA 3.0 |