https://github.com/stratus3d/eratosthenes_sieve
An implementation of the ancient algorithm for finding all the prime numbers under a certain value. Implemented in Elixir.
https://github.com/stratus3d/eratosthenes_sieve
Last synced: about 1 year ago
JSON representation
An implementation of the ancient algorithm for finding all the prime numbers under a certain value. Implemented in Elixir.
- Host: GitHub
- URL: https://github.com/stratus3d/eratosthenes_sieve
- Owner: Stratus3D
- Created: 2014-06-28T20:23:55.000Z (almost 12 years ago)
- Default Branch: master
- Last Pushed: 2021-01-20T14:40:43.000Z (over 5 years ago)
- Last Synced: 2025-02-09T00:19:46.243Z (over 1 year ago)
- Language: Elixir
- Size: 9.77 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Eratosthenses' Sieve
Stratus3D
An implementation of the ancient algorithm for finding all the prime numbers under a certain value. Implemented in Elixir. More information on this algorithm can be found on Wikipedia ([http://wikipedia.org/wiki/Sieve\_of\_Eratosthenes](http://wikipedia.org/wiki/Sieve\_of\_Eratosthenes))
## Build
This project uses Mix. To build this project run `mix`.
## Usage
To test out the application in the console run `iex -pa ebin/` in the project directory.
iex(1)> :application.start(:eratosthenes_sieve)
:ok
iex(2)> EratosthenesSieve.primes(10)
[2, 3, 5, 7]
iex(3)> EratosthenesSieve.primes(20)
[2, 3, 5, 7, 11, 13, 17, 19]
## Issues
No known issues. If you see something that could be improved feel free to open an issue on GitHub ([https://github.com/Stratus3D/eratosthenes\_sieve/issues](https://github.com/Stratus3D/eratosthenes\_sieve/issues))
## Changelog
* 0.1.1 - 7/16/2014
* Application behavior unnecessary. Removed.
* Updated Elixir version to 0.14.0.