Largest difference between adjacent primes: Difference between revisions

No edit summary
Line 264:
oldDiff = 0
 
def isprimeisPrime(n: int) -> bool:
iffor ni <=in 3range(2,int(n**0.5)+1):
returnif n > 1%i==0:
if n % 2 == 0 or n % 3 == 0:
return False
i = 5
while i ** 2 <= n:
if n % i == 0 or n % (i + 2) == 0:
return False
i += 6
return True
 
 
for n in range(limit):
2,468

edits