public static bool IsPrime(long number)
if (number <= 1) return false;
if (number == 2) return true;
if (number % 2 == 0) return false;
var boundary = (int)Math.Floor(Math.Sqrt(number));
for (int i = 3; i <= boundary; i += 2)
public static void Main()
for(int i = 0; i < 80; i++)
res = (long)Math.Pow(i , 2) - (79 * i) + 1601;
Console.WriteLine(res + " Is Prime? " + IsPrime(res));