### 5 releases

0.2.1 | Jul 31, 2022 |
---|---|

0.2.0 | Jul 31, 2022 |

0.1.2 | Jun 21, 2020 |

0.1.1 | Jun 21, 2020 |

0.1.0 | Jun 21, 2020 |

#**1039** in Algorithms

**Custom license**

670KB

16K
SLoC

# primecount-rs

primecount-rs is a library that provides APIs for counting the primes below an integer x ≤ 10^31 using highly optimized implementations of the combinatorial prime counting algorithms.

It is a rust wrapper around an awesome kimwalisch/primecount library.

**References**:

## API

**Add to Cargo.toml of your project:**

`primecount ``=` `"`0.2.0`"`

**Examples:**

`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

- Install cmake
- Update primecount dependency:

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

to build the library`cargo``build`

to run the tests`cargo``test`