Merge branch 'branch1' of https://github.com/Acuspeedster/Python into branch1

Author: Acuspeedster

maths/gcd_of_n_numbers.py

@@ -105,6 +105,7 @@ def get_greatest_common_divisor(*numbers: int) -> int:
         mult *= m
     return mult
 
+
 def gcd_tail_recursive(a: int, b: int) -> int:
     """
     Calculate the Greatest Common Divisor (GCD) using a tail-recursive approach.
@@ -157,6 +158,7 @@ def gcd_tail_recursive(a: int, b: int) -> int:
         return abs(a)
     return gcd_tail_recursive(b, a % b)
 
+
 if __name__ == "__main__":
     print(get_greatest_common_divisor(18, 45))  # 9
     print(gcd_tail_recursive(23, 37))  # 1