Python
Python
def is_armstrong(num):
order = len(str(num))
sum = 0
temp = num
while temp > 0:
digit = temp % 10
sum += digit ** order
temp //= 10
return num == sum
def fibonacci(n):
fib_series = [0, 1]
for i in range(2, n):
fib_series.append(fib_series[-1] +
fib_series[-2])
return fib_series[:n]
def is_palindrome(s):
return s == s[::-1]
class Animal:
def __init__(self, name):
self.name = name
def speak(self):
pass
class Dog(Animal):
def speak(self):
return "Woof!"
class Cat(Animal):
def speak(self):
return "Meow!"
dog = Dog("Buddy")
cat = Cat("Whiskers")
print(dog.name, "says", dog.speak())
print(cat.name, "says", cat.speak())
def is_leap_year(year):
if (year % 4 == 0 and year % 100 != 0) or (year %
400 == 0):
return True
else:
return False
def pyramid_pattern(n):
for i in range(n):
print(" " * (n - i - 1) + "*" * (2 * i + 1))
# Example matrices
matrix1 = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
matrix2 = [[9, 8, 7], [6, 5, 4], [3, 2, 1]]
result_matrix = matrix_multiplication(matrix1,
matrix2)
for row in result_matrix:
print(row)
def is_prime(num):
if num <= 1:
return False
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
return False
return True