We Solve Problems
Problems
Categories
F.A.Q.
Language
English
Español
Sign In
Sign Up
Sign Up
Problem
#PRU-100609
Problems
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\)
.
To see the solution
register
and get verified.