IsPrimeNumber() - Is a number a prime number

[guinness]

expandcollapse popup

#region Required project assemblies

using System;

#endregion

namespace IsPrimeNumber
{
    internal class Program
    {
        private static bool IsPrimeNumber(int number, out int divisibleBy)
        {
            divisibleBy = -1; // Set the out parameter as -1, for those numbers which are prime values.
            if (number <= 1)
            {
                return false; // Return false if the value is less than or equal to one.
            }

            for (int i = 2; i <= Math.Sqrt(number); i++)
            {
                if (number % i == 0)
                {
                    divisibleBy = i; // Set the out param as the divisible by value.
                    return false;
                }
            }
            return true; // This means it's a prime number.
        }

        private static void Main()
        {
            int userChoice;
            do
            {
                Console.Write("Please enter an integer number to see if it's a prime number: ");
                Int32.TryParse(Console.ReadLine(), out userChoice);
                Console.WriteLine(); // New line.
            } while (userChoice <= 0);

            int numberDivisible;
            if (IsPrimeNumber(userChoice, out numberDivisible))
            {
                Console.WriteLine("Your number is a prime value.");
            }
            else
            {
                if (numberDivisible == -1)
                {
                    Console.WriteLine("Your number is NOT regarded as a prime value.");
                }
                else
                {
                    Console.WriteLine("Your number is NOT a prime value as it's divisible by {0}.", numberDivisible);
                }
            }
            Console.WriteLine(); // New line.

            Console.WriteLine("Press any key to continue . . .");
            Console.ReadKey(true);
        }
    }
}

 

Edited July 13, 2015 by Jon
Changed language

[Mat]

Once you've tested 2, you don't need to test for divisibility by any other even numbers. That means for most numbers you effectively halve the modulus operations needed, so should halve the runtime.

Finding primes is always a very interesting problem. I've spent a fair bit of time on it over the years. Most recently I wrote this piece of gibberish which makes a huge prime sieve, for all the numbers from 0 to 0xFFFFFFFF, and counts the number of primes. The bitmap for the sieve is 256MB, and I meant to try and find out how programs work that unload ranges of data to/from disk efficiently so I could work on a bigger range but never got round to it.

[guinness]

Good point, I could refactor this a little more. Nice code by the way.