Skip to content

Instantly share code, notes, and snippets.

@rosiecakes
Created October 29, 2016 00:41
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save rosiecakes/3a78a41e8eecf588c6293d8e7678605c to your computer and use it in GitHub Desktop.
Save rosiecakes/3a78a41e8eecf588c6293d8e7678605c to your computer and use it in GitHub Desktop.
"""This is the entry point of the program."""
def _is_prime(number):
# import ipdb; ipdb.set_trace()
for n in range((number - 1), 1, -1):
if number % n == 0:
return False
return True
def list_of_prime_numbers(max_number):
# Alternate solution
# return [n for n in range(1, (max_number + 1)) if _is_prime(n)]
results = []
for number in range(1, (max_number + 1)):
if _is_prime(number):
results.append(number)
return results
if __name__ == '__main__':
print(_is_prime(19))
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment