Primes – Always the bloody primes

Find the first n prime numbers
Don’t make the mistake of only calculating if a number is prime up to n. Find the first n primes.

private static void primes(int n)
 {
    int primesFound = 0;
    int testingNumber = 0;

    while (primesFound < n)
    {
       bool isPrime = true;
       for (int i = 2; i < testingNumber; i++)
       {
          if (testingNumber % i == 0)
          {
             isPrime = false;
          }
       }
       if (isPrime)
       {
          Console.WriteLine(testingNumber);
          primesFound++;
       }
       testingNumber++;
    }
 }