Exercise 08-07:
Define a recursive function that calculates the greatest common divisor (G.C.D.) between two numbers a and b, where a > b.
Where
can be written in Python as: a % b.
Answer:
##############################################################################
# Python From Scratch
# Author: Nilo Ney Coutinho Menezes
# Editora Novatec (c) 2010-2025 - LogiKraft 2025
# Site: https://pythonfromscratch.com
# ISBN: 978-85-7522-949-1 (Paperback), 978-85-7522-950-7 (hardcover), 978-85-7522-951-4 (ebook)
#
# File: chapter 08/exercise-08-07.py.py
##############################################################################
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
print(f"GCD of 10 and 5 --> {gcd(10,5)}")
print(f"GCD of 32 and 24 --> {gcd(32,24)}")
print(f"GCD of 5 and 3 --> {gcd(5,3)}")