maths/least_common_multiple very inefficient

[fhlasek]

The time complexity of the least common multiple implementation is O(max(A, B)) where A and B are the function parameters.

Much more efficient implementation uses the formula with the greatest common divisor which is already implemented efficiently in this repo.

[cclauss]

Without a benchmark, this seems to be a theoretical supposition with no executable proof.