primecount 0.1.1

Rust wrapper for https://github.com/kimwalisch/primecount.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

# primecount-rs

primecount-rs is a library that provides APIs for counting the primes below an integer x ≤ 1031 
using highly optimized implementations of the combinatorial 
[prime counting algorithms](https://en.wikipedia.org/wiki/Prime-counting_function#Algorithms_for_evaluating_%CF%80(x)).

It is a rust wrapper around an awesome [kimwalisch/primecount](https://github.com/kimwalisch/primecount) library.

## API

```rust
use primecount;

fn main() {
    println!("Primes below 1000 = {}", primecount::pi(1000));
    println!("Numbers below 1000 that are not divisible by any of the first 100 primes (a.k.a. Legendre-sum) = {}", primecount::phi(1000, 100));
    println!("10th prime = {}", primecount::nth_prime(10));
}
```

## Contribute

### Update primecount dependency 

```
git submodule update --init --recursive
```