Strong and weak primes: Difference between revisions

#include <locale>

#include <sstream>

 

int main() {

 

// find the prime numbers up to array_size

 

// write numbers with groups of digits separated according to the system default locale

}</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;