Sum of GCD and LCM is the sum of those numbers

Question

I'm really stuck with this.

Let $a,b\in \mathbb{Z}^+$ such that $$ GCD(a,b) + LCM(a,b) = a+b $$ then either $a|b$ or $b|a$.

I tried using the fact that the GCD is a linear combination of the numbers or the equality $GCD \times LCM = ab $ without absolute value because $ab>0$.

Edit:

Apparently, when the sum of the GCD and LCM is the sum of $a$ and $b$ then one of them is the GCD.

Answer 1

Notation: $GCD(a,b)=g$, and $LCM(a,b)=l$.

It is well-known that $gl=ab$.

Substituting in your relation, we have, $g+\frac{ab}{g}=a+b$, which means: $g^2-(a+b)g+ab=0$.

So that, $(g-a)(g-b)=0$.

So $g=a$ or $g=b$, which means $a\mid b$ or $b\mid a$. QED.

Answer 2

With no loss of generality we assume $a\leq b$. We are given the condition $(,)+(,)=+$ we seek to verify $a|b$.

$a$ divides the lcm by definition, if in addition $a|gcd$ then $a$ also divides $b=gcd + lcm -a$, which would suffice for the proof.

Does $a|gcd$? Since $gcd\times lcm = ab$ then $b=\frac{gcd\times lcm}{a}$ and substitute this into $(,)+(,)=+$ we have that $$(,)+(,)=+\frac{(,)+(,)}{a}$$ you find that $gcd / a$ is an integer, so a divides the gcd. Your claim is verified.