pub fn first_n_primes(n: usize) -> Vec<u64>
The first n primes.
n
Uses the prime-counting upper bound n * (ln n + ln ln n) (scaled with a safety factor) to pick a sieve limit, then expands if necessary.
n * (ln n + ln ln n)