Proving the Identity: gcd(a, lcm(b,c))

  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Identity
Dragonfall
Messages
1,023
Reaction score
5
Is this identity true?

gcd(a, lcm(b,c)) = lcm(gcd(a,b), gcd(a,c))
 
Physics news on Phys.org
What have you tried so far?

Have you looked for counter examples or attempted a proof?

Do you have an idea of how to prove/disprove statements like these?
 
I have already proven it, since the exponents of the all primes of the canonical factorization of a, b and c obeys min(a,max(b,c))=max(min(a,b),min(a,c)).
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top