Skip to content

Instantly share code, notes, and snippets.

@OskarSigvardsson
Created March 8, 2015 15:59
Show Gist options
  • Save OskarSigvardsson/9b320f7e4fa116b4be46 to your computer and use it in GitHub Desktop.
Save OskarSigvardsson/9b320f7e4fa116b4be46 to your computer and use it in GitHub Desktop.
from math import sqrt
def is_prime(n):
for divisor in range(2, int(sqrt(n))+1):
if n % divisor == 0:
return False
return True
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment