Problem #PRU-100607

Problems Number Theory Divisibility The greatest common divisor (GCD) and the least common multiplier (LCM). Mutually prime numbers

Problem

The gcd of the two numbers \(a\) and \(b\) is \(40\). What is their smallest possible product? How large can their product be?