Jump to content

Smarandache prime-digital sequence: Difference between revisions

m
Typo fix
(Added C solution)
m (Typo fix)
Line 234:
for (uint32_t p = 2; p * p <= limit; ++p) {
if (bit_array_get(&s->not_prime, p) == false) {
for (size_tuint32_t q = p * p; q <= limit; q += p)
bit_array_set(&s->not_prime, q, true);
}
1,777

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.