initSidebarItems({"fn":[["as_perfect_power","Returns integers `(y, k)` such that `x = y^k` with `k` maximised (other than for `x = 0, 1`, in which case `y = x`, `k = 1`)."],["as_prime_power","Return `Some((p, k))` if `x = p^k` for some prime `p` and `k >= 1` (that is, including when `x` is itself a prime)."],["estimate_nth_prime","Gives estimated bounds for *p<sub>n</sub>*, the `n`th prime number, 1-indexed (i.e. *p<sub>1</sub>* = 2, *p<sub>2</sub>* = 3)."],["estimate_prime_pi","Returns estimated bounds for π(*n*), the number of primes less than or equal to `n`."],["is_prime_miller_rabin","Test if `n` is prime, using the deterministic version of the Miller-Rabin test."]],"struct":[["PrimeIterator","Iterator over the primes stored in a sieve."],["Primes","Stores information about primes up to some limit."],["StreamingSieve","A segmented sieve that yields only a small run of primes at a time."]],"type":[["Factors","(prime, exponent) pairs storing the prime factorisation of a number."]]});