Nodejs Number Modulor Calculate mod(n)

Method Source Code

// Create a function named divisors that takes an integer and returns an array with all of the integer's divisors(except for 1 and the number itself). If the number is prime return the string '(integer) is prime' (use Either String a in Haskell).

// Example:/*ww  w  . ja  va  2s .c  om*/

// divisors(12); //should return [2,3,4,6]
// divisors(25); //should return [5]
// divisors(13); //should return "13 is prime"
// You can assume that you will only get positive integers as inputs.

Number.prototype.mod = function(n) {
    return ((this%n)+n)%n;
}

var divisors = (num) => {
  var holder = []
  for(var i = 2; i < num; i++){
    if(num % i == 0){
      holder.push(i)
    }
  }
  return holder.length != 0 ? holder : num + " is prime"
}

console.log(divisors(13))

Related

1. mod( n )

   Number.prototype.mod = function( n ) {
     return ( ( this % n ) + n ) % n;
   };
   

2. mod(d)

   Number.prototype.mod =function(d) {
     var rem = this%d;
     return rem < 0? d+rem: rem;
   };
   

3. mod(n)

   Number.prototype.mod = function(n) {
       return ((this % n)+ n ) % n;
   

4. mod(n)

   Number.prototype.mod = function (n) {
     return ((this % n) + n) % n;
   

5. mod(n)

   Number.prototype.mod = function(n) {
     return ((this%n)+n)%n;
   

6. mod(n)

   Number.prototype.mod = function(n)
       "use strict";
       return ((this%n)+n)%n;
   };