int[] Primes;
private void FindPrimes(int numberOfPrimeToFind)
{
	Primes = new int[numberOfPrimeToFind];
	Primes[0] = 2;
	int primeCount = 1;
	for (int primeCandidate = 3; primeCount < numberOfPrimeToFind; primeCandidate++)
	{
		if (IsPrime(primeCandidate))
		{
			Primes[primeCount] = primeCandidate;
			primeCount++;
		}
	}
}

private bool IsPrime(int primeCandidate)
{
	int maxDivisor = (int)Math.Sqrt(primeCandidate);
	int i = 0;
	while (Primes[i] <= maxDivisor)
	{
		if (primeCandidate % Primes[i] == 0)
		{
			return false;
		}
		i++;
	}
	return true;
}