Sexy primes: Difference between revisions

m
Minor edit to C++ code
m (Minor edit to C++ code)
m (Minor edit to C++ code)
Line 340:
} else {
// find the groups of sexy primes that begin with p
int group_size = 1;
vector<int> group;
group.push_back(p);
whilefor (int group_size = 1; group_size < max_group_size; group_size++) {
int next_p = p + group_size * diff;
if (next_p >= max || !sieve.is_prime(next_p))
Line 349 ⟶ 348:
group.push_back(next_p);
++group_count[group_size];
groups[group_size++].push_back(group);
}
}
1,777

edits