Granted...

lcm(a,b) = (a * b) / gcd(a,b).

Gcd can be worked out via 'Euclidean Algorithm'.

But how do work out a lcm(range:1...10)?

I understand a number is the product of its primes. And how this is used to work out lcm(a,b).

I have found: http://projecteuler.net/project/reso...5_overview.pdf but do not understand past the "So how do we solve this programmatically?" line.

Thanks