Is LCM Associative? Tackling the Proof

  • Thread starter Thread starter 1MileCrash
  • Start date Start date
  • Tags Tags
    associative
1MileCrash
Messages
1,338
Reaction score
41

Homework Statement



I need to prove that the least common multiple operation is associative.


Homework Equations





The Attempt at a Solution



Pages of crappy algebra trying to use the fact that LCM(a,b) = |ab|/gcd(a,b)

I hate to be "that guy" that doesn't post much of an attempt but I am getting nowhere with this. Maybe a hint or a fact about the LCM that will lead to a proof..?
 
Physics news on Phys.org
Let ##x = \textrm{LCM}(a,\textrm{LCM}(b,c))## and ##y=\textrm{LCM}(\textrm{LCM}(a,b),c)##.

First, show that ##a## divides both ##x## and ##y##. And the same for ##b## and ##c##. Then show that ##\textrm{LCM}(b,c)## divides ##y## and that ##\textrm{LCM}(a,b)## divides ##x##.

Start with that.
 
Alright, thank you.

I am currently trying an argument with prime factorization that seems... reasonable, but I will try this too.
 
I'm trying to use the fact that if ##a## divides a number ##z## and if ##b## divides a number ##z##, then ##\textrm{LCM}(a,b)## divides ##z##. Do you know this fact? Try to prove it.
 
Oh, I think I got you. They divide each other using that property (nearly) alone.
 
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