euler 3

by Hensixteen

JavaScript

var num = 600851475143;
var testCount;
var testPrime;
var count;

var prime = false;
var divisible = false;
var solved = false;

for(testCount = 2; solved == false; testCount++) {
	if((num%testCount) == 0) {
  
		testPrime = (num/testCount);
    solved = testForPrime(testPrime);
    
    console.log(testPrime + "  -  " + solved);

	}
}

function testForPrime(testNum) {

		for(count = 2; count < testNum; count++) {
  
  		if(count>(testNum/2)) {
      	return true;
      }
  
  		else if(testNum%count == 0) {
      	return false;
      }
  
  	}

}