AnthonyMikh/least_common_divisor.hs

## least_common_divisor.hs
--gcd=greatest common divisor
gcd' x y
    | x < y = gcd' y x
    | x == y = x
    | otherwise = let x' = x - y in x' `seq` gcd' x' y

--lcm=least common divisor
lcm' x y =
    let prod = x*y
    in prod `seq` prod `div` gcd' x y

main = putStrLn . show $ lcm' 6 4 --12
	--gcd=greatest common divisor
	gcd' x y
	\| x < y = gcd' y x
	\| x == y = x
	\| otherwise = let x' = x - y in x' `seq` gcd' x' y

	--lcm=least common divisor
	lcm' x y =
	let prod = x*y
	in prod `seq` prod `div` gcd' x y

	main = putStrLn . show $ lcm' 6 4 --12