def menu():

print("\n\nMenu:")
print("\t1. Prime")
print("\t2. Prime Series")
print("\t3. Perfect")
print("\t4. Perfect Series")
print("\t5. Armstrong")
print("\t6. Armstrong Series")
print("\t7. Fibonacci Series")
print("\t8. Factorial")
print("\t9. Leap Year")
print("\t10.Quadratic Equations")
print("\t11.Quit")
access = int(input("Make a selection from the above list: "))
return access

def prime_check(x):
if (x<2):
return False
for i in range(2,x):
if (x % i ==0):
return False
return True

def prime_series(n):
for n in range(1,n+1):
count=0
for i in range(2,(n//2+1)):
if (n%i==0):
count=count+1
break
if (count==0 and n!=1):
print("%d"%n,end=" ")

def perfect_series(n):
series = list()
for i in range(1, n + 1):
sum = 0
for j in range(1, i):
if i % j == 0:
sum += j
if sum == i:
series.append(i)
return series

def perfect_number(number):
Sum = 0
for i in range(1, number):
if(number % i == 0):
Sum = Sum + i
return Sum

def armstrong_check(num):
temp = num
sum = 0
 while temp > 0:
digit = temp % 10
sum += digit ** 3
temp //= 10
if num == sum:
return True
else:
return False

def armstrong_series(n):
series = list()
for i in range(1, n + 1):
sum = 0
temp = i
while temp > 0:
digit = temp % 10
temp //= 10
sum += digit ** 3
if sum == i:
series.append(i)
return series

def fibonacci_series(x, n1 = 0, n2 = 1, i = 0):

while (i<x):
term = n1 + n2
Flist.append(term)
i += 1
n1, n2 = n2, term

def factorial(x):
y=1
for i in range(1,x+1):
y=y*i
return y

def leap_year(n):
if (( n%400 == 0)or (( n%4 == 0 ) and ( n%100 != 0))):
return True
else:
return False

def quadratic_equation(a,b,c):
d=(b*b)-(4*a*c)
if (d>0):
rt1=((-b)+d**(1/2))/(2*a)
rt2=((-b)-d**(1/2))/(2*a)
print("Two distinct real roots exist:",(rt1,rt2))
elif (d==0):
rt1=rt2=(-b)/(2*a)
print("Two equal and real roots exist:",(rt1,rt2))
elif (d<0):
rt1=rt2=(-b)/(2*a)
imgn=(-d)**(1/2)/(2*a)
print("Two distinct complex roots exist:",(rt1,imgn,rt2,imgn))
while True:
access = menu()
if access == 1:
x = int(input(’Enter a Number : ’))
if prime_check(x):
print(x,’ is a Prime Number’)
elif x==1:
print(x,’ is neither Prime nor Composite’)
else:
print(x,’ is not Prime Number’)
elif access==2:
n = int(input(’Enter the Range to display prime numbers: ’))
print("Prime series till %d is:"%n)
prime_series(n)
elif access==3:
number = int(input("Please Enter any number: "))
if (number == perfect_number(number)):
print("%d is a Perfect Number" %number)
else:
print("%d is not a Perfect Number" %number)
elif access==4:
number = int(input("Enter the number till which you want series : "))
perfect = perfect_series(number)
print("Perfect series till", number, "is", perfect)
elif access==5:
n = int(input("Enter a number: "))
if armstrong_check(n):
print("It is an Armstrong number")
else:
print("Not an Armstrong number")
elif access==6:
number = int(input("Enter the number till which you want the series : "))
armstrong = armstrong_series(number)
print("Armstrong series till", number, "is", armstrong)
elif access==7:
x = int(input(’Enter required number of terms : ’))
Flist = []
fibonacci_series(x)
print(Flist)
elif access==8:
a=int(input("Enter a number:"))
while a<0:
a=int(input("Enter a number:"))
print(factorial(a))
elif access==9:
number=int(input("Enter the year:"))
while (number <= 0):
print("You have entred invaid")
number=int(input("Enter the year:"))
if leap_year(number):
print("LEAP YEAR")
else :
print("NOT LEAP YEAR")
elif access==10:
a=int(input("Enter a value:"))
 b=int(input("Enter b value:"))
c=int(input("Enter c value:"))
if a == 0:
print("Input correct quadratic equation")
else:
quadratic_equation(a, b, c)
elif access==11:
print("Exiting...")
break
else:
print("\nPlease enter a number between 1-11\n\n")