Created
October 22, 2019 08:38
-
-
Save Reikon95/f0f337cc78c1fea012d92a4acfba1d3a to your computer and use it in GitHub Desktop.
Euler problem 3
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function isPrime(num) { | |
| for (let i = 2; i < num; i++) { | |
| if (num % i === 0) { | |
| return false; | |
| } | |
| } | |
| } | |
| function largestPrimeFactor(number) { | |
| let factors = []; | |
| let primefactors = [number]; | |
| for (let i = 2; i < number; i++) { | |
| if (Number.isInteger(number / i)) { | |
| factors.push(i); | |
| } | |
| } | |
| for (let elem of factors) { | |
| if (isPrime(elem) === false) { | |
| continue; | |
| } else { | |
| primefactors.push(elem); | |
| } | |
| } | |
| return primefactors[primefactors.length - 1]; | |
| } | |
| console.log(largestPrimeFactor(7)); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment