# Gcd(a, b, c) = gcd(gcd(a,b), c)

I basically have to prove that gcd(a, b, c) = gcd(gcd(a,b), c).
So I know that if I just need to prove that the sets {a, b, c} and {gcd(a,b), c} have the same sets of divisors.

tiny-tim
Homework Helper
welcome to pf!

hi ashwinb! welcome to pf!
gcd(a, b, c) = gcd(gcd(a,b), c)

you usually do this sort of thing by proving separately:
i] gcd(a, b, c) ≤ gcd(gcd(a,b), c)
ii] gcd(a, b, c) ≥ gcd(gcd(a,b), c)

how far have you got?

A straightforward way of proving this is to use the prime factorizations of a, b, and c, that is, write a=∏ipαi, b=∏ipβi, and c=∏ipγi. Then gcd(a,b,c)=∏ipmin(αiii). Likewise, gcd(gcd(a,b),c)=∏ipmin(min(αii),γi). These are equal since min(αiii)=min(min(αii),γi).