Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions gcdCalculator.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
def gcd(a, b):
while b:
a, b = b, a % b
return a

def main():
try:
num1 = int(input("Enter the first positive integer: "))
num2 = int(input("Enter the second positive integer: "))
if num1 <= 0 or num2 <= 0:
print("Please enter positive integers.")
else:
result = gcd(num1, num2)
print(f"The greatest common divisor of {num1} and {num2} is {result}.")
except ValueError:
print("Invalid input. Please enter positive integers.")

if __name__ == "__main__":
main()
17 changes: 17 additions & 0 deletions palindromeChecker.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
def is_palindrome(text):
# Remove spaces and convert to lowercase for case-insensitive comparison
text = text.replace(" ", "").lower()

# Compare the original text with its reverse
return text == text[::-1]

def main():
text = input("Enter a word or phrase to check for palindrome: ")

if is_palindrome(text):
print(f"'{text}' is a palindrome!")
else:
print(f"'{text}' is not a palindrome.")

if __name__ == "__main__":
main()
26 changes: 26 additions & 0 deletions primeNumberChecker.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
def is_prime(number):
if number <= 1:
return False
if number <= 3:
return True
if number % 2 == 0 or number % 3 == 0:
return False

i = 5
while i * i <= number:
if number % i == 0 or number % (i + 2) == 0:
return False
i += 6

return True

def main():
number = int(input("Enter a number to check for prime: "))

if is_prime(number):
print(f"{number} is a prime number!")
else:
print(f"{number} is not a prime number.")

if __name__ == "__main__":
main()