Problem #PRU-100607

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

Problem

The gcd of numbers \(a\) and \(b\) is \(40\). What can be their smallest possible product? What could be their greatest possible product?