// The straightforward approach: prime-test on odd numbers and keep track of the count.
The straightforward approach: prime-test on odd numbers and keep track of the count.
The straightforward approach : prime - test on odd numbers and keep track of the count .
pub fn nth(n: u32) -> u32 {
    std::iter::once(2)
        .chain((3..).step_by(2).filter(|i| is_odd_prime(*i)))
        .nth(n as usize)
        .unwrap()
}
pub fn nth ( n : u32 ) -> u32 { std :: iter :: once ( 2 ) . chain ( ( 3 .. ) . step_by ( 2 ) . filter ( | i | is_odd_prime ( * i ) ) ) . nth ( n as usize ) . unwrap ( ) }
The straightforward approach: prime-test on odd numbers and keep track of the count.
The straightforward approach : prime - test on odd numbers and keep track of the count .
n
u32