title: How can I find the prime factors of an integer in JavaScript?
body: <p>I was trying to find the prime factors of a number, recorded below as 'integer' using a for loop in javascript. I can't seem to get it working and I'm not sure whether it's my JavaScript or my calculation logic.</p>
  <p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
  <div class="snippet-code">
  <pre class="snippet-code-js lang-js prettyprint-override"><code>//integer is the value for which we are finding prime factors
  var integer = 13195;
  
  var primeArray = [];
  
  //find divisors starting with 2
  
  for (i = 2; i &lt; integer/2; i++) {
    if (integer % i == 0) {
  
      //check if divisor is prime
      for (var j = 2; j &lt;= i / 2; j++) {
        if (i % j == 0) {
          isPrime = false;
        } else {
          isPrime = true;
        }
      }
  
      //if divisor is prime
  
      if (isPrime == true) {
        //divide integer by prime factor &amp; factor store in array primeArray
        integer /= i
        primeArray.push(i);
      }
    }
  }
  
  for (var k = 0; k &lt; primeArray.length; k++) {
    console.log(primeArray[k]);
  }</code></pre>
  </div>
  </div>
  </p>