Problem #PRU-100609

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

Problem

Show that \(a-b\) is divisible by the greatest common divisor of \(a\) and \(b\).