Here you can find the source of divisors()
Number.prototype.divisors = function(){ var ans = [], max = this;/* ww w . j av a 2 s .c om*/ for(i=1; i<max; i++){ if(max.isDivisor(i)){ ans.push(i); } } ans.push(max.valueOf()); return ans; }
Number.prototype.allDivisors = function () { var ans = []; var max = this; for (var i=1;i<= max/2;i++) { if (max.isDivisor(i)) { ans.push(i); ans.push(max.valueOf()) ...
Number.prototype.divisors = function () { "use strict"; var ans = [], max = this; for (i = 1; i < max; i += 1) { if (max.isDivisor(i)) { ans.push(i); if (ans.length > 30) { console.log("amount " + ans.length); return ans; };
Number.prototype.divisors = function(){ var ans = []; var max= this; for(var i=1; i<=this; i++){ if(this.isDivisor(i)){ ans.push(i); return ans; ...
Number.prototype.divisors = function(){ var ans = []; var max = this; for(i = 1; i<=max/2; i++){ if(this.isDivisor(i)){ ans.push(i); ans.push(this.valueOf()); ...
Number.prototype.divisors = function () { var ans = [], max = this; for (i = 1; i <= max / 2; i++) { if (max.isDevisor(i)) { ans.push(i); ans.push(max.valueOf()); ...
Number.prototype.divisors = function () { "use strict"; var ans = [], max = this; for (let i = 1; i < max; i += 1) { if (max.isDivisor(i)) { ans.push(i); if (ans.length > 30) { console.log("amount " + ans.length); ans.push(max.valueOf()); return ans; };
Number.prototype.isDivisibleBy = function(divisor) { if (this == 0) return false; return this % divisor === 0; };
Number.prototype.isDivisor = function (num) { "use strict"; var ans = false; if ((this / num).isInteger()) { ans = true; return ans; };
Number.prototype.isDivisor = function(num){ var ans = false; if((this/num).isInteger()){ ans = true; return ans;