Jump to content

Repunit primes: Difference between revisions

m
C++ - simplified code (also seems to be slightly faster)
m (Minor edit to C++ code)
m (C++ - simplified code (also seems to be slightly faster))
Line 77:
std::vector<std::future<std::vector<uint64_t>>> futures;
for (uint32_t base = 2; base <= 36; ++base) {
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";
Line 90 ⟶ 89:
 
{{out}}
This takes about 4 minutes 2412 seconds (3.2GHz Quad-Core Intel Core i5).
<pre>
Repunit prime digits (up to 2700) in:
1,777

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.