Prime Number in csharp

In this article we will learn about Prime Number in csharp. Prime numbers are natural numbers that are divisible by only 1 and the number itself. In other words, prime numbers are positive integers greater than 1 with exactly two factors, 1 and the number itself. Some of the prime numbers include 2, 3, 5, 7, 11, 13, etc.

Always remember that 1 is neither prime nor composite. Thus, all prime numbers are greater than 1. Also, we can say that except for 1, the remaining numbers are classified as prime and composite numbers. In this article, we will learn how to get prime number programming in c#. Please read our previous article Palindrome in C#.

Prime Number in csharp

Today in this article I will share you how to create Prime number in C#. This is the common question of any interviewer if you are fresher. So I explain in details what is prime number and how to check the number is prime or not.

What is Prime Number?

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. 

Example:

using System;
namespace PrimeNumber
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine("Enter a number");
            int number = Convert.ToInt32(Console.ReadLine());
            int result = Check_Prime(number);
            if (result == 0)
            {
                Console.WriteLine("{0} is not a prime number", number);
            }
            else
            {
                 Console.WriteLine("{0} is  a prime number", number);
            }            
            Console.Read();
        } 

        private static int Check_Prime(int number)
       {
            int i;
            for (i = 2; i <= number - 1; i++)
            {
                if (number % i == 0)
                {
                    return 0;
                }
            }
            if (i == number)
            {
                return 1;
            }
            return 0;
        }
    }  
}

Output:

Enter the Number to check Prime: 13
Number is Prime.   

Enter the Number to check Prime: 41
Number is not Prime.

To prove whether a number is a prime number, first try dividing it by 2, and see if you get a whole number. If you do, it can’t be a prime number. If you don’t get a whole number, next try dividing it by prime numbers: 3, 5, 7, 11 (9 is divisible by 3) and so on, always dividing by a prime number (see table below).Here is a table of all prime numbers up to 1,000:

Hope It will clear about the Prime Number. Still have any question regarding this, Please have give feedback.