Nodejs Number Prime Number Check primeFactorization()

Method Source Code

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)/*w  w  w . j  a  va 2s  .  c o m*/
        }
    }
    for(let i = 0; i<primes.length;i++){
        while(temp.isDivisor(primes[i])){
            ans.push(primes[i]);
            temp = temp/primes[i];
        }
    }
    return ans;
}

Related

1. 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);
   

2. isPrime()

   Number.prototype.isPrime = function() {
     var primeCandidate = this;
     if(primeCandidate <= 1 || primeCandidate%1 !== 0) return false
     var i = 2;
     var top = Math.floor(Math.sqrt(primeCandidate));
     while(i<=top){
       if(primeCandidate%i === 0){ return false; }
       i++;
     return true;
   

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 = 0; i <= temp/2; i++) {
       if (i.allDivisors().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];
     console.log(ans);
   

7. primeFactorization()

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

8. primeFactorization()

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

9. primeFactorization()

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