function findSumPrimes(p, n) {
          var notPrimes = [];
          while(p*p < n) {
            for(var i = p; (i*p) <= n; i++) {
              notPrimes.push(i*p);
            }
            p++;
          }
          var sumPrimes = 0;
          for(var j = 2; j < n; j++) {
           if(notPrimes.indexOf(j) == -1) {
              sumPrimes += j;
            }
          }
          return sumPrimes;
        }
        alert( findSumPrimes(2, 100) );