int factor( int n )	// Return lowest factor (or 1).
{
	int k;
	for ( k=n-1; k>1; k-- )			// n-1 down to 2
	{
		if ( n % k == 0 ) return k;	// Found a factor.
	}
	return 1;				// No factors.
}
int main()
{
	int number;
	int many=1, howmany=100;
	printf( " %i PRIMES\n", howmany );


	 // Print the first 1000 primes. 
	printf( "%i is a prime\n", 2 );
	for ( number=3; many<howmany; number += 2)
	{
		if (factor(number) < 2) 	// Find a factor.
		{
			// No factor -- print & count it.
			printf( "%i is a prime\n", number );
			many++;
		}
	}
}