for a pair gcd by Euclid then lcm (a, b) = a/gcd(a, b) * b
Dunno how you can extend this to a list lcm(a, b, c ...z) ??
On Sat, 29 Mar 2008 00:51:00 -0700 (PDT)
punchik punchik [EMAIL PROTECTED] wrote:
hi, i need to calculate the lowest common mulitple of
50 periods ...
i have a
Hmm, sorry I messed up on the gcd so ignore attached it doesn't work
On Sat, 29 Mar 2008 09:22:36 +
Andy Farnell [EMAIL PROTECTED] wrote:
for a pair gcd by Euclid then lcm (a, b) = a/gcd(a, b) * b
Dunno how you can extend this to a list lcm(a, b, c ...z) ??
On Sat, 29
On 29/03/2008, at 10.22, Andy Farnell wrote:
for a pair gcd by Euclid then lcm (a, b) = a/gcd(a, b) * b
Dunno how you can extend this to a list lcm(a, b, c ...z) ??
Maybe using 'lcm(a,b,c) = lcm(lcm(a,b),c)' (which is true sine they
share prime factors).