Project Euler Homework
|
Find the 10001st prime. More...
#include <iostream>
Go to the source code of this file.
Functions | |
int | next (int i) |
int | main () |
Variables | |
const unsigned | largeN = 2e5 |
int | count = 0 |
bool | primes [largeN+1] |
Find the 10001st prime.
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number?
Definition in file 007.cpp.