10001stPrime.c

#include <stdio.h>
#include <stdbool.h>
#include <math.h>

bool IsItPrime(int candidate)
{
	int i, last;
	if (candidate < 2)
		return false;
	else
	{
		last = (int)sqrt(candidate);
		for (i = 2; i <= last; i++)
		{
			if((candidate % i) == 0)
				return false;
		}
	}
	return true;
}

int main (int argc, const char * argv[])
{
	int i = 1;
	int counter = 0;
	while (counter < 10001)
	{
		
				if (IsItPrime(i))
				{
				counter++;
				printf( "%d: %d \n", counter, i);
				}
				if (i <= 2)
					i+=1;
				else
					i+=2;

			
	}
	printf( "All the primes from 1-%d.", i - 2);
	return 0;
}