Skip to content

Latest commit

 

History

History
15 lines (11 loc) · 394 Bytes

task.md

File metadata and controls

15 lines (11 loc) · 394 Bytes
Raw

Least Common Multiple

The least common multiple $\operatorname{LCM}(a,b)$ of two positive integers $a$ and $b$ is the smallest integer $m$ that is divisible by both $a$ and $b$.

How $\operatorname{LCM}(a,b)$ is related to $\operatorname{GCD}(a,b)$?

Compute the least common multiple of two integers $1 \le a, b \le 2 \cdot 10^9$.