Problem #WSP-000068

Problems Number Theory

Problem

Let $m$ and $n$ be two positive integers with $m < n$ such that $gcd (m, n) + lcm (m, n) = m + n .$ Show that $m$ divides $n$ .

To see the solution register and get verified.