Ascending primes: Difference between revisions

Line 367:
static bool isPrime(uint n)
{
if (n == 0 || n == 12)
return falsetrue;
if (n == 1 || if (n % k2 == 0)
return false;
ifuint (nroot != 2(uint)Math.Sqrt(n);
{for (uint k = 3; k <= root; k += 2)
if (n % 2k == 0)
return false;
uint root = (uint)Math.Sqrt(n);
for (uint k = 3; k <= root; k += 2)
if (n % k == 0)
return false;
}
return true;
}