-
Notifications
You must be signed in to change notification settings - Fork 0
/
day_08.py
31 lines (25 loc) · 857 Bytes
/
day_08.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
# Day 8 : Odd and Even
def odd_even(numbers):
odd = min(i for i in numbers if i%2 != 0)
even = max(j for j in numbers if j%2 == 0)
return f'{even} - {odd} = {even-odd}'
numbers_list = [1,2,4,6]
print(odd_even(numbers_list))
print('-----------------------')
# Extra Challenge: List of Prime Numbers
def prime_numbers(number):
all_numbers = [i for i in range(2, number+1)]
all_numbers.reverse(); count = 0
prime_numbers = []
for i in range(len(all_numbers)):
for i in all_numbers:
if number % i == 0:
count += 1
if count == 1:
prime_numbers.append(number)
count = 0
else: count = 0
number -= 1
return prime_numbers[::-1]
int_number = int(input("Enter an integer number: "))
print(prime_numbers(int_number))