View difference between Paste ID: YY2e7NeH and 2yp9Vmf7

 using System;
 
 /*08. Write an expression that checks if given positive integer number n (n ≤ 100) is prime (i.e. it is divisible without remainder only to itself and 1). Examples:
 n	Prime?
 1	false
 2	true
 3	true
 4	false
 9	false
 97	true
 51	false
 -3	false
 0	false
 
 */
 
 class PrimeNumberCheck
 {
     static void Main()
     {
         Console.Write("Enter a positive integer n (n <= 100) = ");
         int number = int.Parse(Console.ReadLine());
 
         bool check = true;
         int divider = 2;
         int maxDivider = (int)Math.Sqrt(number);
 
         // въртим един цикъл докато divider-a не стане колкото максималния възможен делител
  	if (number <= 0)
         {
             check = false;
         }
 
         while (check && (divider <= maxDivider))
         {
             if (number % divider == 0)
             {
                 check = false;
             }
             divider++;
         }
         Console.WriteLine("Prime? --> "+check);
     }
 }