Repunit primes: Difference between revisions
Content added Content deleted
m (Minor edit to C++ code) |
m (C++ - simplified code (also seems to be slightly faster)) |
||
| Line 77: | Line 77: | ||
std::vector<std::future<std::vector<uint64_t>>> futures; |
std::vector<std::future<std::vector<uint64_t>>> futures; |
||
for (uint32_t base = 2; base <= 36; ++base) { |
for (uint32_t base = 2; base <= 36; ++base) { |
||
futures.push_back(std::async( |
futures.push_back(std::async(repunit_primes, base, primes)); |
||
[base, &primes] { return repunit_primes(base, primes); })); |
|||
} |
} |
||
std::cout << "Repunit prime digits (up to " << limit << ") in:\n"; |
std::cout << "Repunit prime digits (up to " << limit << ") in:\n"; |
||
| Line 90: | Line 89: | ||
{{out}} |
{{out}} |
||
This takes about 4 minutes |
This takes about 4 minutes 12 seconds (3.2GHz Quad-Core Intel Core i5). |
||
<pre> |
<pre> |
||
Repunit prime digits (up to 2700) in: |
Repunit prime digits (up to 2700) in: |
||