Check if the given number is a prime number

Any number which cannot be divisible by any other number except one and itself is called a prime number. In other words, any number which doesn't have more than 2 factors (1 and itself) is called a prime number.

Examples: 2, 3, 11, 13, 19 and such

For a given number n, we shall find out the total factors for the number and decide whether the number is a prime or not.


        public static bool DoIsPrimeNumber(int n)
        {
            // fetch the factors for n
            List<int> factors = DoGetFactors(n);

            return factors.Count > 2 ? false : true;
        }
        

How it works:

For a given number n, we’ll find out all the factors and then see if the Count of the factors is more than 2 or not. If it is two we’ll return it is a prime, since by definition a prime number can’t have more than 2 factors.

Join the Newsletter

Subscribe to get our latest content by email.
    We won't send you spam. Unsubscribe at any time.
    Ram
    Ram

    I'm a full-stack developer and a software enthusiast who likes to play around with cloud and tech stack out of curiosity. You can connect with me on Medium, Twitter or LinkedIn.

    Join the Newsletter

    Subscribe to get our latest content by email.
    We won't send you spam. Unsubscribe at any time.
    Privacy Overview
    Referbruv

    This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.

    Strictly Necessary Cookies

    Strictly Necessary Cookie should be enabled at all times so that we can save your preferences for cookie settings.

    3rd Party Cookies

    This website uses Google Analytics to collect anonymous information such as the number of visitors to the site, and the most popular pages.

    Keeping this cookie enabled helps us to improve our website.