-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfibo_problem.py
More file actions
64 lines (55 loc) · 1.26 KB
/
Copy pathfibo_problem.py
File metadata and controls
64 lines (55 loc) · 1.26 KB
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
def isprime(number):
counter = 0
output = False
for i in range(1,number+1):
rem = number%i
if rem ==0:
counter += 1
if counter ==2:
output = True
return output
def iseven(number):
output = False
rem = number%2
if rem == 0:
output = True
return output
def isodd(number):
output = False
rem = number%2
if rem != 0:
output = True
return output
def fibosec(limit):
fibo_list = [1, 1]
n = 2
an = 1
while an < limit:
an = fibo_list[n - 1] + fibo_list[n - 2]
fibo_list.append(an)
n += 1
fibo_list = fibo_list[:-1]
return fibo_list
## main code ##
limit = 100
fibo_list = fibosec(limit)
print('fibonacci sequence: ')
print(fibo_list)
print('--------------------')
listODD = []
listEVEN = []
for number in fibo_list:
## check if number is odd
out1 = isodd(number)
if out1 ==True:
listODD.append(number)
## check if number is even
out1 = iseven(number)
if out1 ==True:
listEVEN.append(number)
print('odd numbers:')
print(list(set(listODD)))
print('-----------------')
print('even numbers:')
print(listEVEN)
print('-----------------')