public static bool IsPrime(int number)
if (number <= 1) return false;
if (number == 2) return true;
if (number % 2 == 0) return false;
var boundary = Sqrt(number);
for (int i = 3; i <= boundary; i+=2)
public static int Sqrt(int num) {
if (num == 0) { return 0; }
int n1 = (n + (num / n)) / 2;
Console.WriteLine("n " + n);
Console.WriteLine("n1 " + n1);
n1 = (n + (num / n)) / 2;
Console.WriteLine("n after" + n);
public static void Main()
Console.WriteLine("num " + number + " prime " + IsPrime(number));