Created
March 31, 2012 13:27
-
-
Save gmuller/2264445 to your computer and use it in GitHub Desktop.
node script to get prime factors of a number. Used to solve project euler problem #3
This file contains 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
#!/usr/local/bin/node | |
/* | |
* Simple Node Script to prime factors of a number | |
*/ | |
var argv = process.argv; | |
if (argv.length != 3) { | |
console.log("Please enter a number to factor"); | |
process.exit(1); | |
} | |
var value = argv[2]; | |
var number = value; | |
while(true){ | |
var values = getValues(number); | |
if (values[0] === 1 || values[0]/values[1] === 1){ | |
console.log("MPF of " + value + " is " + values[1]); | |
process.exit(0); | |
} else { | |
number = values[0]; | |
} | |
} | |
function getValues(number){ | |
for (i=2; i <= number; i++) { | |
if (number % i === 0){ | |
console.log("Found Prime Factor: " + i); | |
return [number/i, i]; | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment