mirror of
https://github.com/TheAlgorithms/Ruby
synced 2024-12-26 21:58:56 +01:00
23 lines
466 B
Ruby
23 lines
466 B
Ruby
# LCM (Least Common Multiple) of two numbers is the smallest number which can be divided by both numbers.
|
|
|
|
p 'Least Common Multiple'
|
|
|
|
p 'Enter first number'
|
|
value_one = gets.chomp.to_i
|
|
|
|
p 'Enter second number'
|
|
value_two = gets.chomp.to_i
|
|
|
|
def gcd(first, second)
|
|
if second != 0
|
|
gcd(second, first % second)
|
|
else
|
|
first
|
|
end
|
|
end
|
|
|
|
def lcm(first, second)
|
|
(first * second) / gcd(first, second)
|
|
end
|
|
|
|
p "Least Common Multiple is: #{lcm(value_one, value_two)}"
|