Greatest Common Divisor (GCD), simplified

gcd.coffee

gcd = (a,b) -> if b then gcd b, a%b else a
mcm = (a,b) -> a*b / gcd(a,b)

gcd.groovy

def gcd(a,b) {
  if (!b) a
  else gcd(b, a%b)
}

def mcm(a,b) {
  a*b / gcd(a,b)
}

gcd.py

def gcd(a,b):
  if b==0: return a
  return gcd(b, a%b)

def mcm(a,b):
  return a*b / gcd(a,b)

gcd.rb

def gcd(a,b)
  if b==0: a
  else gcd(b, a%b)
  end
end

def mcm(a,b)
  a*b / gcd(a,b)
end