1. Write a program to find the lowest Missing number from the list
def missing_num(li):
n=len(li)
for i in range(1,n+1):
if i not in li:
return i
return n+1
l=[1,4,6]
print("missing num: ",missing_num(l))
OUTPUT:
missing num: 2
2. Write a Program to print Fibonacci Series
def fibonacci(n):
if n <= 1:
return n
else:
return fibonacci(n - 1) + fibonacci(n - 2)
# Input number of terms
terms = int(input("Enter n: "))
# Generate and print Fibonacci series for each term
for i in range(terms):
print(fibonacci(i))
OUTPUT :
Enter n: 9
0
1
1
2
3
5
8
13
21
3. Determine whether the number is a prime or not ?
def prime(n):
if n<=1:
return False
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
num=int(input("enter n: "))
if prime(num):
print("prime number")
else:
print("not a prime number")
OUTPUT :
enter n: 7
prime number
4. Program to count occurrence of elements from a list
li=[1,2,3,4,5,4,2,2,6]
count=dict()
for i in li:
if i in count:
count[i]+=1
else:
count[i]=1
print(count)
OUTPUT :
{1: 1, 2: 3, 3: 1, 4: 2, 5: 1, 6: 1}
=== Code Execution Successful ===
5 . Write a Program to check a number is Armstrong or not ?
num=(input("enter a number: "))
arms=0
for digit in num:
arms = arms + pow(int(digit), len(num))
if int(num) == arms:
print("its a armstrong number")
else:
print("its not armstrong number")
OUTPUT :
enter a number: 153
its a armstrong number