Nodejs Number Prime Number Check isPrime()

Method Source Code

Number.prototype.isPrime = function() {
  var primeCandidate = this;
  if(primeCandidate <= 1 || primeCandidate%1 !== 0) return false
  var i = 2;//ww  w  .  j  a v  a2  s  .  c om
  var top = Math.floor(Math.sqrt(primeCandidate));
  while(i<=top){
    if(primeCandidate%i === 0){ return false; }
    i++;
  }
  return true;
}

Related

1. isPrime(n)

   Number.prototype.type = 'number';
   Math.isPrime = function(n) {
     if(n==2) { return true; }
     if( (n < 2) || (n%2 == 0) ) { return false; }
     for(var i=3; (i*i)<=n; i+=2) {
       if(n%i == 0) { return false; }
     return true;
   };
   ...
   

2. IsPrime()

   Number.prototype.IsPrime = function() {
     var n = 2,
         isPrime = true;
     while (n < this / 2 && isPrime) {
       isPrime = this % n != 0;
       n++;
     return isPrime;
   var primeCount = 0,
       current = 1;
   while (primeCount <= 10001) {
     current++;
     if (current.IsPrime()) {
       primeCount++;
   console.log(current);
   

3. isPrime()

   Number.prototype.isPrime=function(){
       for(var n=2;n<this;)
         if(!(this%n++))
            return !1;
       return !0}
   function PrimeTime(num) {
     return num.isPrime();
   PrimeTime(readline());
   ...
   

4. isPrime()

   Number.prototype.isPrime=function(){
      for(var n=2;n<this;)
         if(!(this%n++))
            return !1;
      return !0
   var getNextPrime = function(number, max) {
     while(++number <= max)
       if (number.isPrime())
   ...
   

5. isPrime()

   Number.prototype.isPrime = function () {
     var i = 2;
     while (i<=this - 1) {
       if (this % i ==0) {
         return false;
         break;
       i++;
     if (i == this) {
       return true;
   };
   

6. primeFactorization()

   Number.prototype.primeFactorization = function(){
        var ans = [];
       var primes = [];
       var temp = this;
       for(let i=2; i<=this/2; i++){
           if(i.divisors().length==2){
               primes.push(i)
       for(let i = 0; i<primes.length;i++){
           while(temp.isDivisor(primes[i])){
               ans.push(primes[i]);
               temp = temp/primes[i];
       return ans;