Objective

Write a function that computes the least common multiple of two unsigned integers.

Steps

• If either argument is 0, return 0.
• Otherwise return the smallest positive integer that is divisible by both a and b.
• A common approach: lcm(a, b) = a / gcd(a, b) * b to reduce overflow risk.
• The prototype is unsigned int lcm(unsigned int a, unsigned int b);.

Objective

Write a function that computes the least common multiple of two unsigned integers.

Steps

• If either argument is 0, return 0.
• Otherwise return the smallest positive integer that is divisible by both a and b.
• A common approach: lcm(a, b) = a / gcd(a, b) * b to reduce overflow risk.
• The prototype is unsigned int lcm(unsigned int a, unsigned int b);.