Ormiston triples: Difference between revisions
m
Removed unnecessary code.
m (Corrected a spelling mistake.) |
m (Removed unnecessary code.) |
||
Line 284:
for ( uint32_t p = 2; p <= square_root; ++p ) {
if ( marked_prime[p] ) {
primes.emplace_back(
}
}
|