Function slow_primes::estimate_prime_pi
[-] [+]
[src]
pub fn estimate_prime_pi(n: u64) -> (u64, u64)
Returns estimated bounds for π(n), the number of primes less
than or equal to n.
That is, if (a, b) = estimate_prime_pi(n), a ≤ π(n) ≤
b. The bounds used are proved in [1] and [2, Théorème 1.10],
and are summarised in [2, pp. 14–15].
[1]: Barkley Rosser. "Explicit Bounds for Some Functions of Prime Numbers". American Journal of Mathematics 63 (1): 211–232. 1941. doi:10.2307/2371291.
[2]: Dusart, Pierre. "Autour de la fonction qui compte le nombre de nombres premiers." PhD diss., Université de Limoges, 1998.