Lucas-Carmichael numbers: Difference between revisions
m
→{{header|Python}}: minor optimization
(Added Python) |
m (→{{header|Python}}: minor optimization) |
||
Line 507:
def f(m, l, lo, k):
hi = (integer_nthroot(B // m, k))[0]+1▼
if k == 1:
lo = max(lo, A // m + (1 if A % m else 0))
hi = min(
u = l - mod_inverse(m, l)
Line 525 ⟶ 522:
else:
▲ hi = (integer_nthroot(B // m, k))[0]+1
for p in sieve.primerange(lo, hi):
if gcd(m, p+1) == 1:
| |||