Last active
September 19, 2020 16:53
-
-
Save willy-r/faa9bbd809b08ba8cce738e251214375 to your computer and use it in GitHub Desktop.
Determines prime numbers in a list of integers.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from math import sqrt | |
def determine_primes(given_numbers): | |
"""Determines prime numbers in a list of integers.""" | |
primes = [] | |
for possible_prime in given_numbers: | |
is_prime = True | |
for num in range(2, int(sqrt(possible_prime)) + 1): | |
if possible_prime % num == 0: | |
is_prime = False | |
break | |
if is_prime: | |
primes.append(possible_prime) | |
return sorted(set(primes)) | |
if __name__ == '__main__': | |
numbers = [] | |
while True: | |
try: | |
number = int(input('Enter a number (0 to quit): ')) | |
except ValueError: | |
print('Please, enter a integer number.') | |
else: | |
if number == 0: | |
break | |
elif number > 1: | |
numbers.append(number) | |
else: | |
print('Enter a number > 1.') | |
continue | |
primes = determine_primes(numbers) | |
print(*primes, sep=', ') |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment