input: Write a python function to find the least common multiple of two numbers.
  assert find_largest_divisible_number(8, 6) == 24
  assert find_largest_divisible_number(7, 5) == 35
  assert find_largest_divisible_number(12, 15) == 60
output: def find_largest_divisible_number(a, b):
      def gcd(x, y):
          while y:
              x, y = y, x % y
          return x
      
      return abs(a * b) // gcd(a, b)