Ascending primes: Difference between revisions
Content added Content deleted
| Line 1,277: | Line 1,277: | ||
<lang python>def isprime(n): |
<lang python>def isprime(n): |
||
if n == 2: return True |
if n == 2: return True |
||
if |
if n == 1 or n % 2 == 0: return False |
||
root1 = int(n**0.5) + 1; |
root1 = int(n**0.5) + 1; |
||
for k in range(3, root1, 2): |
for k in range(3, root1, 2): |
||