Skip to content

Instantly share code, notes, and snippets.

@frogandcode
Created May 7, 2019 20:16
Show Gist options
  • Save frogandcode/1cb74109b2ab309bf44d50470e42e3ee to your computer and use it in GitHub Desktop.
Save frogandcode/1cb74109b2ab309bf44d50470e42e3ee to your computer and use it in GitHub Desktop.
Primes under 100
print("Prime numbers under 100:")
def is_prime(number):
divisor = 2 # Start with most likely factor and increment
while divisor <= (number / 2):
if ((number % divisor) == 0): return False
divisor += 1
return True
for number in range(2, 100):
if is_prime(number): print(number)
@frogandcode
Copy link
Author

Output:

Prime numbers under 100:
2
3
5
7
11
13
17
19
23
29
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment