project-euler/problem-three.js at master · kheyrasantos/project-euler · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
var n = 13195;
var array = [];
var prime_array = [];

for ( var i = 2; i < n; i++ ) {

    if ( n%i == 0 ) {
        array.push(i);
        console.log(array);
    };

};


function isPrime(n) {

   if (n < 2) {
       return false;
   };

   if ( n != Math.round(n) ) {
       return false;
   };

   var isPrime = true;

   for ( var i = 2; i <= Math.sqrt(n); i++ ) {
      if ( n%i == 0 ) {
          isPrime = false;
      };
  };

   return isPrime;

};


for ( var i = 0; i <= array.length; i++ ) {

    var x = array[i];

    if( isPrime(x) == true ) {
        prime_array.push(x);
        console.log(prime_array + " prime array");
    };

};

var z = prime_array.length - 1;

console.log(prime_array[z] + " is the largest prime factor");