Skip to content

Instantly share code, notes, and snippets.

@mariusschulz
Last active August 29, 2015 14:01
Show Gist options
  • Save mariusschulz/08fb0f684bf435ad1b32 to your computer and use it in GitHub Desktop.
Save mariusschulz/08fb0f684bf435ad1b32 to your computer and use it in GitHub Desktop.
isPrime = (n) ->
return true if n is 2 or n is 3
return false if n % 2 is 0
for i in [3..Math.sqrt n]
return false if n % i is 0
true
primesUnder100 = (n for n in [1..100] when isPrime n)
console.log(primesUnder100)
var isPrime, n, primesUnder100;
isPrime = function(n) {
var i, _i, _ref;
if (n === 2 || n === 3) {
return true;
}
if (n % 2 === 0) {
return false;
}
for (i = _i = 3, _ref = Math.sqrt(n); 3 <= _ref ? _i <= _ref : _i >= _ref; i = 3 <= _ref ? ++_i : --_i) {
if (n % i === 0) {
return false;
}
}
return true;
};
primesUnder100 = (function() {
var _i, _results;
_results = [];
for (n = _i = 2; _i <= 100; n = ++_i) {
if (isPrime(n)) {
_results.push(n);
}
}
return _results;
})();
console.log(primesUnder100);
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment