×

A curious result for GCDs and LCMs. (English) Zbl 1398.11006

Summary: We give necessary and sufficient conditions under which the sum of two positive integers equals the difference of their least common multiple and greatest common divisor, and then prove this result.

MSC:

11A05 Multiplicative structure; Euclidean algorithm; greatest common divisors

Keywords:

gcd; lcm
Full Text: DOI