Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.
|
// https://projecteuler.net/problem=3
|
||
|
|
const problem = 600851475143
|
||
|
|
|
||
|
|
const largestPrime = (num) => {
|
||
|
|
let newnumm = num
|
||
|
|
let largestFact = 0
|
||
|
|
let counter = 2
|
||
|
|
while (counter * counter <= newnumm) {
|
||
|
|
if (newnumm % counter === 0) {
|
||
|
|
newnumm = newnumm / counter
|
||
|
|
} else {
|
||
|
|
counter++
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (newnumm > largestFact) {
|
||
|
|
largestFact = newnumm
|
||
|
|
}
|
||
|
|
return largestFact
|
||
|
|
}
|
||
|
|
console.log(largestPrime(problem))
|