what is an alternative definition for least common multiple besides min{m : a|m and b|m} ?
I think that definition is the most intuitive one as it simply says what the name "least common multiple" means
for two integers \(a,b\) we do have this relationship though : \[\text{lcm}(a,b) = \dfrac{ab}{\gcd(a,b)}\] but that doesn't work for more than two integers
yeah, but It has no arithmetic structure. I was looking for something like i) m > 0 ii) a|m and b|m ...
and that's actually a theorem. I'm looking for a definition though
right, when you do prime factorization, that definition plays very nicely, you can play with the exponents
that same definition can be expressed as below : \(\text{lcm}(a,b)\) is the positive integer \(m\) satisfying : 1) \(a\mid m\) and \(b\mid m\) 2) \(a\mid c\) and \(b\mid c\) \(\implies\) \(m\le c\)
I don't see how that definition is any inferior to the definition of \(\gcd\) what arithmetic structure do you have in mind ?
actually, that's exactly what i was looking for. Some sort of criteria that a least common multiple must follow
ohk.. but yes that definition is pretty useless when prime factorization is not possible
oh... I think it's still better than min{m : a|m and b|m}
both are same, aren't they..
they are indeed. I just prefer the one that is formally written out.
i see what you mean
thank you :D
np:)
Join our real-time social learning platform and learn together with your friends!