Largest difference between adjacent primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 264: / Line 264: @@
 oldDiff = 0
-def isprime(n: int) -> bool:
+def isPrime(n):
-    if n <= 3:
+    for i in range(2,int(n**0.5)+1):
-        return n > 1
+        if n%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):