* Skips even numbers.

* Odd numbers only (wheel factorisation with base 2).

	// Approximated size of the list required using the inverse of an approximation of the prime-counting function.
	let list_size = (corrected_n * (corrected_n * corrected_n.ln()).ln()) as usize + 1;

	// Approximated size of the list required using the inverse of an approximation of the prime-counting function, halved (as we're only interested in odd numbers).
	let list_size = (corrected_n * (corrected_n * corrected_n.ln()).ln() / 2.0) as usize + 1;

		[false, true].repeat((list_size / 2) + 1),

		vec![true; list_size],

	for index in (3..limit).step_by(2) {

	for index in 1..limit {

				return index as u32;

				return (index * 2 + 1) as u32;

			(index.pow(2)..list_size)
				.step_by(index)
				.for_each(|multiple| {
					list[multiple] = false;
				});

			for multiple in (((index * 2 + 1).pow(2) - 1) / 2..list_size).step_by(index * 2 + 1) {
				list[multiple] = false;
			}

	if limit & 1 == 1 {
		for index in (limit..list_size).step_by(2) {
			if list[index] {
				count += 1;
				if count > n {
					// Might panic if values greater than u32::MAX are cast.
					return index as u32;
				}
			}
		}
	} else {
		if list[limit] {

	for index in limit..list_size {
		if list[index] {

				return limit as u32;

				return (index * 2 + 1) as u32;

		for index in ((limit + 1)..list_size).step_by(2) {
			if list[index] {
				count += 1;
				if count > n {
					// Might panic if values greater than u32::MAX are cast.
					return index as u32;
				}
			}
		}