Skip to content

Project Euler problem 005 solution #488

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pomkarnath98 merged 5 commits into from
Feb 13, 2021
Merged

Project Euler problem 005 solution #488

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
74d5715
add a solution for Project Euler problem #005
Waddah-JD Oct 15, 2020
03d3720
add a solution for Project Euler problem #006
Waddah-JD Oct 15, 2020
b26baef
remove files to merge from seprate brnches
Waddah-JD Oct 17, 2020
13da905
add solution for Project Euler 005
Waddah-JD Oct 17, 2020
de4504f
Rename Problem005.js to Problem5.js
pomkarnath98 Feb 13, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions Project-Euler/Problem5.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
/*
Smallest multiple

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?
*/

const findSmallestMultiple = () => {
const divisors = [20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2]
let num = 21
let result

while (!result) {
const isDivisibleByAll = divisors.every((divisor) => num % divisor === 0)
if (isDivisibleByAll) result = num
else num++
}

return result
}

console.log(findSmallestMultiple())