Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def is_prime1(n):
- for i in range(2, int(math.sqrt(n) + 1)):
- if n % i == 0:
- return False
- return n > 1
- def is_prime2(n, d=3):
- if n < 2 or n != 2 and n & 1 == 0:
- return False
- if d * d > n:
- return True
- return n % d and is_prime2(n, d + 2)
- def is_prime3(n):
- return ~-2 ** n % n < 2
- def is_prime4(n):
- return sympy.isprime(n)
Add Comment
Please, Sign In to add comment