Shahed Mohammad Hridoy shahedpy

## list_comprehension.py
nums = [5, 7, 9, 10]
squares = [x**2 for x in nums]

## swap_variable.py
a = 5
b = 3

a, b = b, a

## palindrome_check.py
def is_palindrome(text: str) -> bool:
  return text == text[::-1]

## armstrong_number.py
def is_armstrong(number: int) -> bool:
  digits = str(number)
  num_digits = len(digits)
  total = sum(int(digit) ** num_digits for digit in digits)
  return total == number

num = int(input("Enter a number: "))
if is_armstrong(num):
  print(f"{num} is an Armstrong number.")
else:

## factorial.py
def factorial(x):
    if x == 1:
        return 1
    else:
        return x * factorial(x-1)

print(factorial(5))

## prime_number_generator.py
def isPrime(x):
    if x < 2:
        return False
    elif x == 2:
        return True
    for n in range(2, x):
        if x % n ==0:
            return False
    return True

## hello_world.py
print("Hello World!")
	def is_palindrome(text: str) -> bool:
	return text == text[::-1]
	def is_armstrong(number: int) -> bool:
	digits = str(number)
	num_digits = len(digits)
	total = sum(int(digit) ** num_digits for digit in digits)
	return total == number

	num = int(input("Enter a number: "))
	if is_armstrong(num):
	print(f"{num} is an Armstrong number.")
	else:
	def factorial(x):
	if x == 1:
	return 1
	else:
	return x * factorial(x-1)

	print(factorial(5))
	def isPrime(x):
	if x < 2:
	return False
	elif x == 2:
	return True
	for n in range(2, x):
	if x % n ==0:
	return False
	return True