Circular primes: Difference between revisions

#include <algorithm>

#include <iostream>

#include <gmpxx.h>

 

bool is_prime(const integer& n, int reps = 50) {

return mpz_probab_prime_p(n.get_mpz_t(), reps);

}

 

if (!is_prime(p))

return false;

for (size_t i = 0, n = str.size(); i + 1 < n; ++i) {

std::rotate(str.begin(), str.begin() + 1, str.end());

std::cout << "Next 4 circular primes:\n";

p = next_repunit(p);

int digits = str.size();

for (int count = 0; count < 4; ) {

R(49081) is probably prime

</pre>

=={{header|D}}==

{{trans|C}}