var num = 600851475143;
var largest = 0;
var max = Math.ceil(Math.sqrt(num));
for(i=3;i<=max;i+=2){
not = false;
if(num%i == 0){
if(i%2 != 0){
for(j=3; j <= Math.ceil(Math.sqrt(i));j +=2){
if(i%j == 0){
not = true;
}
}
if(not == false) largest = i;
}
}
}
document.write("Euler #3 Javascript: "+largest+"
");
Euler Problem #3:
6857 total time: 1sec
$num = 600851475143;
$max = ceil(sqrt($num));
for($i=3;$i<=$max;$i+=2){
$not = false;
if(fmod($num,$i)==0){
//echo $i."
";
if(fmod($i,2) != 0){
for($j = 3; $j <= ceil(sqrt($i)); $j += 2) {
if(fmod($i,$j) == 0) {
$not = true;
}
}
if($not == false) $largest = $i;
}
}
}
echo $largest;