Wikipedia

Search results

Saturday, January 27, 2024

CLASS XI: IMPORTANT PROGRAMS OF PYTHON

1.  Write a program to check if all the elements of a tuple are in descending order or not

# function to check if tuple is sorted in descending order
def is_tuple_sorted(t):
for i in range(1, len(t)):
# return False if the element is greater than the previous element
if t[i] > t[i-1]:
return False
return True
# create a tuple
t = (5, 4, 3, 2, 1)
# check if tuple is sorted
2. # Python program to check if the number is an Armstrong number or not

# take input from the user
num = int(input("Enter a number: "))

# initialize sum
sum = 0

# find the sum of the cube of each digit
temp = num
while temp > 0:
   digit = temp % 10
   sum += digit ** 3
   temp //= 10

# display the result
if num == sum:
   print(num,"is an Armstrong number")
else:
   print(num,"is not an Armstrong number")

Output 1

Enter a number: 663
663 is not an Armstrong number

Output 2

Enter a number: 407
407 is an Armstrong number

Here, we ask the user for a number and check if it is an Armstrong number.

We need to calculate the sum of the cube of each digit. So, we initialize the sum to 0 and obtain each digit number by using the modulus operator %. The remainder of a number when it is divided by 10 is the last digit of that number. We take the cubes using exponent operator.

Finally, we compare the sum with the original number and conclude that it is Armstrong number if they are equal.

Source Code: Check Armstrong number of n digits

num = 1634

# Changed num variable to string, 
# and calculated the length (number of digits)
order = len(str(num))

# initialize sum
sum = 0

# find the sum of the cube of each digit
temp = num
while temp > 0:
   digit = temp % 10
   sum += digit ** order
   temp //= 10

# display the result
if num == sum:
   print(num,"is an Armstrong number")
else:
   print(num,"is not an Armstrong number")

You can change the value of num in the source code and run again to test it.

Did you find this article helpful?


No comments:

Post a Comment