FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaScriptAlgorithm/Project-Euler/Problem005.js at master · RabibHossain/JavaScriptAlgorithm · GitHub
RabibHossain
/
JavaScriptAlgorithm
Public
forked from
TheAlgorithms/JavaScript
Notifications
You must be signed in to change notification settings
Fork
1
Star
1
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaScriptAlgorithm
/
Project-Euler
/
Problem005.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
20 lines (16 loc) · 567 Bytes
Breadcrumbs
JavaScriptAlgorithm
/
Project-Euler
/
Problem005.js
Copy path
File metadata and controls
20 lines (16 loc) · 567 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/*
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?
*/
export
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
}
Back
|
FazBrowse Home
|
New Git URL