Lowest Common Multiple (LCM)
Learn how to solve the 'Lowest Common Multiple (LCM)' problem. This detailed resource details brute force and optimized approaches.
Problem Statement
Write a function find_lcm(a, b) that takes two positive integers a and b and returns their Lowest Common Multiple (LCM). The LCM is the smallest positive integer that is divisible by both a and b.
Hint: You can use the relationship LCM(a, b) = (a * b) / GCD(a, b).
- •1 <= a, b <= 10^6
Examples
find_lcm(4, 6)
12
Multiples of 4: 4, 8, 12, 16, ... Multiples of 6: 6, 12, 18, ... The smallest common multiple is 12.
find_lcm(3, 5)
15
Multiples of 3: 3, 6, 9, 12, 15, ... Multiples of 5: 5, 10, 15, ... The smallest common multiple is 15.
find_lcm(12, 18)
36
GCD(12,18) = 6. LCM = (12 * 18) / 6 = 216 / 6 = 36.
Need a Hint?
Edge Cases to Watch
- Empty list or null input variables
- Single item lists/arrays
- Extremely large input bounds causing integer or stack overflow
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.