2

Here's the problem:

Prove that $(a,b,c) = ((a,b),c)$, where $(\cdot)$ denotes the GCD.

This problem looks so trivial at staring, but rigorously proving it turns out to be difficult task for me.

I know of $2$ ways of defining GCD (of, say $b$ and $c$): The least positive value of $(bx_1 + cy_1)$; or the common divisor which is divisible by every other common divisor. This definition can extend to more than $2$ numbers also.

So, I let $g$ be any common divisor of $a$, $b$ and $c$, and $G$ be the greatest of them.

Hence, matters are left to merely proving $G = ((a,b),c)$.

It is quite easily seen that $G|(a,b)$ and $G|c$. Hence, $G|((a,b),c)$. But it leaves the proof to: $((a,b),c)|G$, which I can't prove.

Perhaps it is proving: $g|((a,b),c)$, for any $g$ (which is defined above). This can lead to another proof, but I didn't find a way out!

Please help!

0 Answers0