





def _a       (			lowerCamelCase:     int      ,       lowerCamelCase:     int      ,       lowerCamelCase:     int				)			->		float:







      '''simple docstring'''






      if common_ratio == 1:
            # Formula for sum if common ratio is 1
            return num_of_terms * first_term

      # Formula for finding sum of n terms of a GeometricProgression
      return (first_term / (1 - common_ratio)) * (1 - common_ratio**num_of_terms)












import unittest
from timeit import timeit



def _a       (			lowerCamelCase:     int      ,       lowerCamelCase:     int				)			->		int:







      '''simple docstring'''






      __A      =       first_num if first_num >= second_num else second_num
      __A      =       max_num
      while (common_mult % first_num > 0) or (common_mult % second_num > 0):
            common_mult += max_num
      return common_mult



def _a       (			lowerCamelCase:     int      ,       lowerCamelCase:     int				)			->		int:







      '''simple docstring'''






      return b if a == 0 else greatest_common_divisor(b % a      ,       lowerCamelCase				)



def _a       (			lowerCamelCase:     int      ,       lowerCamelCase:     int				)			->		int:







      '''simple docstring'''






      return first_num // greatest_common_divisor(lowerCamelCase      ,       lowerCamelCase				) * second_num



def _a       (			)			->		Tuple:







      '''simple docstring'''






      __A      =       (
          '''from __main__ import least_common_multiple_slow, least_common_multiple_fast'''
      )
      print(
          '''least_common_multiple_slow():'''      ,       timeit('''least_common_multiple_slow(1000, 999)'''      ,       setup=lowerCamelCase				)      ,       )
      print(
          '''least_common_multiple_fast():'''      ,       timeit('''least_common_multiple_fast(1000, 999)'''      ,       setup=lowerCamelCase				)      ,       )





class A_      (    unittest.TestCase     ):
   lowerCAmelCase__       =				(
       (10, 20),
       (13, 15),
       (4, 31),
       (10, 42),
       (43, 34),
       (5, 12),
       (12, 25),
       (10, 25),
       (6, 9),
   )
   lowerCAmelCase__       =				(20, 195, 124, 210, 1462, 60, 300, 50, 18)




   def _lowerCAmelCase   (self			:List[str]				)->      Union[str, Any]:
         for i, (first_num, second_num) in enumerate(self.test_inputs				):
               __A      =       least_common_multiple_slow(_UpperCamelCase					,     _UpperCamelCase				)
               __A      =       least_common_multiple_fast(_UpperCamelCase					,     _UpperCamelCase				)
               with self.subTest(i=_UpperCamelCase				):
                     self.assertEqual(_UpperCamelCase					,     self.expected_results[i]				)
                     self.assertEqual(_UpperCamelCase					,     self.expected_results[i]				)


if __name__ == "__main__":
       benchmark()
       unittest.main()





