Miroirs/TheAlgorithms-Ruby
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Ruby synced 2025-01-28 19:58:20 +01:00
Code Issues Projects Releases Packages Wiki Activity

Merge pull request #35 from ievax/project-euler-problem5

Browse source 
Added the fifth problem from project Euler
This commit is contained in:
Christian Bender 2019-02-15 18:22:34 +01:00 • committed by GitHub
commit 4d0b9f2223
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 23 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
Project Euler/Problem 5/problem5_sol1.rb Normal file
View file

@ -0,0 +1,23 @@
# 2520 is the smallest number that can be divided
# by each of the numbers from 1 to 10 without any remainder.
# What is the smallest positive number that is evenly
# divisible by all of the numbers from 1 to 20?
# Euclid's algorithm for the greatest common divisor
def gcd(a, b)
b.zero? ? a : gcd(b, a % b)
end
# Calculate the LCM using GCD
def lcm(a, b)
(a * b) / gcd(a, b)
end
result = 1
20.times do |i|
result = lcm(result, i + 1)
end
p result