Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- 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 10 001st prime number?
- */
- #include <stdio.h>
- #include <stdbool.h>
- int main(void)
- {
- int i, j, primen = 2;
- bool isPrime;
- for ( i = 5; i <= 1000000000; i +=2 ) // count from 5 to 1 mil
- {
- isPrime = true; // set isPrime to true
- for ( j = 2; j < i / 2; j++ ) // count from 2 to i / 2 within i
- {
- if ( i % j == 0 ) // if i / j is whole number, i is not prime
- isPrime = false;
- }
- if ( isPrime != false) // if isPrime is not false, increase primen
- {
- primen++;
- if ( primen == 10001 ) // print primen and terminate when it's 100001
- {
- printf("%i\n", i);
- return 1;
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement