Unprimeable numbers: Difference between revisions

<lang cpp>#include <iostream>

#include <cstdint>

 

typedef uint32_t integer;

 

// returns true if n unprimeable

if (sieve.is_prime(n))

return false;

int main() {

const integer limit = 10000000;

 

// print numbers with commas

}</lang>

 

 

#include <algorithm>

* See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes.

*/

public:

bool is_prime(size_t) const;

private:

* @param limit the maximum integer that can be tested for primality

*/

limit = std::max(size_t(3), limit);

is_prime_.resize(limit/2, true);

* @return true if the integer is prime

*/

if (n == 2)

return true;