


import unittest
from timeit import timeit






def 						_A						(						_lowercase			,       _lowercase				)			->				int:


     """simple docstring"""


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






def 						_A						(						_lowercase			,       _lowercase				)			->				int:


     """simple docstring"""


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






def 						_A						(						_lowercase			,       _lowercase				)			->				int:


     """simple docstring"""


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






def 						_A						(						)			->				str:


     """simple docstring"""


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



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







       def 						snake_case_					(	self:				Optional[int]			):






            '''simple docstring'''




            for i, (first_num, second_num) in enumerate(self.test_inputs			):
                 __UpperCamelCase				=	least_common_multiple_slow(lowercase_,lowercase_			)
                 __UpperCamelCase				=	least_common_multiple_fast(lowercase_,lowercase_			)
                 with self.subTest(i=lowercase_			):
                      self.assertEqual(lowercase_,self.expected_results[i]			)
                      self.assertEqual(lowercase_,self.expected_results[i]			)


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






import math






def 						_A						(						_lowercase				)			->				bool:


     """simple docstring"""


     if 1 < number < 4:
          # 2 and 3 are primes
          return True
     elif number < 2 or number % 2 == 0 or number % 3 == 0:
          # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
          return False

     # All primes number are in format of 6k +/- 1
     for i in range(5			,       int(math.sqrt(_lowercase				) + 1				)			,       6				):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True






def 						_A						(						_lowercase = 2_00_00_00				)			->				int:


     """simple docstring"""


     return sum(num for num in range(3			,       _lowercase			,       2				) if is_prime(_lowercase				)				) + 2 if n > 2 else 0


if __name__ == "__main__":
    print(f"""{solution() = }""")


