/primal

primal puts raw power into prime numbers.
prime-numbers rust
  1. Rust 99.8%
  2. Shell 0.2%
Switch branches/tags
Nothing to show
Find file
Clone or download

Clone with HTTPS

Use Git or checkout with SVN using the web URL.

Open in Desktop Download ZIP

Launching GitHub Desktop...

If nothing happens, download GitHub Desktop and try again.

Launching GitHub Desktop...

If nothing happens, download GitHub Desktop and try again.

Launching Xcode...

If nothing happens, download Xcode and try again.

Launching Visual Studio...

If nothing happens, download the GitHub extension for Visual Studio and try again.

@bors[bot] @huonw
bors[bot] and huonw Merge #22 
22: Use Codecov instead of coveralls r=cuviper a=huonw



Co-authored-by: Huon Wilson <wilson.huon@gmail.com>
Latest commit e7fbe98 Dec 17, 2018
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
benches benches: move to criterion. Dec 6, 2018
ci ci: don't force install cargo-travis. Dec 11, 2018
examples Clean up warnings and dependencies Aug 3, 2017
primal-bit all: deny warnings to catch more problems earlier. Dec 17, 2018
primal-check all: deny warnings to catch more problems earlier. Dec 17, 2018
primal-estimate all: deny warnings to catch more problems earlier. Dec 17, 2018
primal-sieve all: deny warnings to catch more problems earlier. Dec 17, 2018
primal-slowsieve all: deny warnings to catch more problems earlier. Dec 17, 2018
src all: deny warnings to catch more problems earlier. Dec 17, 2018
wheel-generator Refactor a few bits and pieces in sieve and wheel generator. Apr 28, 2016
.gitignore Ignore junk directory. Jun 6, 2015
.travis.yml ci: switch from coveralls to codecov. Dec 11, 2018
Cargo.toml benches: move to criterion. Dec 6, 2018
LICENSE-APACHE Initial commit. Aug 16, 2014
LICENSE-MIT Initial commit. Aug 16, 2014
README.md ci: switch from coveralls to codecov. Dec 11, 2018
bors.toml bors: add appropriate configuration for it. Dec 11, 2018

README.md

primal

Build Status codecov crates.io

primal puts raw power into prime numbers.

This crates includes

  • optimised prime sieves
  • checking for primality
  • enumerating primes
  • factorising numbers
  • estimating upper and lower bounds for π(n) (the number of primes below n) and pk (the kth prime)

This uses a state-of-the-art cache-friendly Sieve of Eratosthenes to enumerate the primes up to some fixed bound (in a memory efficient manner), and then allows this cached information to be used for things like enumerating and counting primes.

primal takes around 2.8 seconds and less than 3MB of RAM to count the exact number of primes below 1010 (455052511) on the author's laptop (i7-3517U).

Documentation