Project euler problem 5 solution

Issue5.scala

object Issue5 {
  def gcd(a: Long, b: Long): Long = {
    if (b == 0) a else gcd(b, a % b)
  }

  def lcm(a: Long, b: Long) = {
    a * b / (gcd(a, b))
  }

  def smallestLcm(l: List[Long]) = {
    l.foldLeft(1L)(lcm(_, _))
  }

  def main(args: Array[String]) {
    println(smallestLcm((1L to 10L).toList))
    println(smallestLcm((1L to 20L).toList))
  }
}