{
if (n == 2)
return true;
if (n % 2 == 0)
return false; bool primeFound = true;
unsigned __int64 maxPrimeSeek = sqrt((long double)n) + 1;
for (unsigned __int64 i = 3; i <= maxPrimeSeek; i=i+2)
{ if (!(n % i))
{
primeFound = false;
break;
}
}
return primeFound;
}