algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

remove files to merge from seprate brnches

Browse Source
This commit is contained in:
Waddah
2020-10-17 23:11:26 +03:00
parent 03d3720c26
commit b26baef31e
2 changed files with 0 additions and 46 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
Project-Euler/Problem005.js
View File

@ -1,22 +0,0 @@
/*
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())

24
Project-Euler/Problem006.js
View File

@ -1,24 +0,0 @@
/*
Sum square difference
The sum of the squares of the first ten natural numbers is 385,
The square of the sum of the first ten natural numbers is 3025,
Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 - 385 = 2640.
Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
*/
const findSumSquareDifference = (elementsCount) => {
const naturalNumbers = Array(elementsCount).fill().map((_, i) => i + 1)
let sumOfSquares = 0
naturalNumbers.forEach(number => { sumOfSquares += Math.pow(number, 2) })
const sumOfNumbers = naturalNumbers.reduce((prev, current) => { current += prev }, 0)
const squareOfSums = Math.pow(sumOfNumbers, 2)
return squareOfSums - sumOfSquares
}
console.log(findSumSquareDifference(20))