Last active
December 18, 2015 20:39
-
-
Save andrewrlee/5841823 to your computer and use it in GitHub Desktop.
Calculating prime numbers in coffeescript
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| fs = require 'fs' | |
| number = 1 | |
| result = [2] | |
| isPrime = (number) -> [ 0..Math.sqrt number ].every (i) -> number % result[i] != 0 | |
| findPrimes = -> | |
| number+=2 | |
| result.push number if isPrime number | |
| findPrimes() while result.length < 100 | |
| fs.writeFileSync "result.txt", result.join() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment