
Python Program to Convert Decimal to Binary using recursive function
def decitobin(n):
if n > 1:
decitobin(n // 2)
print(n % 2,end='')
num = int(input("Enter any decimal number: "))
decitobin(num)
Output:
Enter any decimal number: 42
>
101010>
def decitobin(n):
if n > 1:
decitobin(n // 2)
print(n % 2,end='')
num = int(input("Enter any decimal number: "))
decitobin(num)
Output:
Enter any decimal number: 42
>
101010>
write a function that reads the contents of the String and counts the number of alphabets, lowercase letters, uppercase letters, digits and no of words. def count(str): alpha, uppercase, lowercase, di
Program: n = int(input("Enter Positive Number : ")) sum = 0 sum= ((n*n)*(n+1)*(n+1))/4 print("The Sum of Series is",sum) Output: Enter Positive Number : 2 The Sum of Series is 9.0
The mathematical formula to find the sum of 1²+2²+3²+….+n² is n(n+1)(2n+1)/6 So to find the sum of series we use this formula. Program: n = int(input("Enter Positive Number : ")) sum = 0 sum= (n*(n+