input: Write a function to find the GCD of two numbers using the Euclidean algorithm. The function should return the GCD of the two numbers provided as arguments.
  def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)
  assert findGCD(1000, 500) == 500
  assert findGCD(14, 21) == 7
  assert findGCD(48, 18) == 6
  assert findGCD(7, 3) == 1
  assert findGCD(15, 46) == 1
output: def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)