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).