Nodejs Number Prime Number Check primeFactorization()

Method Source Code

Number.prototype.primeFactorization = function(){
  var ans = [];/*  w  ww.  j  ava 2s  .  co m*/
  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;
      }
    }
  }
  for(let i=0; i<primes.length; i++){
    while(temp.isDivisor(primes[i])){
      temp = temp/primes[i];
      ans.push(primes[i]);
    }
  }

  return ans;
}

Related

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

2. 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())
   ...
   

3. 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;
   };
   

4. 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;
   

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

6. 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;
   

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

8. primeFactorization()

   Number.prototype.primeFactorization = function (){
       console.log("prime aangekomen");
       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.isDivisor(primes[i])){
                   ans.push(primes[i]);
                   temp = temp/primes[i];
       return ans;
   };
   

9. primeFactorization()

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