Python/great.py at master · DevaGaneshB/Python · GitHub

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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
print("enter 3 nos")
a=input()
b=input()
c=input()
d=max(a,b,c)
print("Max="+str(d))


print("enter 2 nos")
a=input()
b=input()
c=a-b
print('sub='+str(c))


print("enter 2 nos")
a=input()
b=input()
c=a+b
print('sum='+str(c))


print("enter 2 nos")
a=input()
b=input()
c=a*b
print('MUL='+str(c))


print("enter 2 nos")
a=input()
b=input()
c=a/b
print('QUT='+str(c))


print("enter 2 nos")
a=input()
b=input()
c=a%b
print('MOD='+str(c))


print("enter 2 nos")
a=input()
b=input()
print('A='+str(a))

print('B='+str(b))


print("enter 2 nos")


print("Enter  a number")
n=input()
def primegen(a):
  b=[]
  flag=0
  for i in range (1,a):
    flag=0
    for j in range(1,i):
      if (i%j) == 0:
        flag=flag+1
    if flag<2:
      b.append(i)
  print(b)
primegen(n)


print("Enter a no")
a=input()
def fibonacci(a):
  s=[]
  i=0
  a1=0
  a2=1
  s.append(a1)
  s.append(a2)
  while i<a:
    (a1,a2)=(a2,a1+a2)
    s.append(a2)
    i=i+1
  print(s)
fibonacci(a)