Advertisement
hackthecode

Problem2.PrimeChecker / Homework: C# Advanced Topics

Dec 14th, 2015
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C# 0.75 KB | None | 0 0
  1. using System;
  2.  
  3. namespace _02.PrimeChecker
  4. {
  5.     class PrimeChecker
  6.     {
  7.         static void Main()
  8.         {
  9.             Console.Write("Enter a integer number > 1 to check if it's prime: ");
  10.             long n = long.Parse(Console.ReadLine());
  11.             Console.WriteLine(IsPrime(n));
  12.         }
  13.         static bool IsPrime(long n)
  14.         {
  15.             if (n < 2)
  16.             {
  17.                 return false;
  18.             }
  19.             // Eratosthenes Algorithm  https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
  20.             for (int i = 2; i <= Math.Sqrt(n); i++)
  21.             {
  22.                 if (n % i == 0)
  23.                 {
  24.                     return false;
  25.                 }
  26.             }
  27.             return true;
  28.         }
  29.     }
  30. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement