Anonymous user
Strong and weak primes: Difference between revisions
Changed countup(n * n, N, n) to countup(n * n, N, 2 * n).
(Changed countup(n * n, N, n) to countup(n * n, N, 2 * n).) |
|||
Line 1,179:
for n in countup(3, sqrt(N.toFloat).int, 2):
if not comp[n]:
for k in countup(n * n, N, 2 * n):
comp[k] = true
| |||