Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 929577
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T20:11:46+00:00 2026-05-15T20:11:46+00:00

I am trying to write a prime number function in C# and I am

  • 0

I am trying to write a prime number function in C# and I am wondering if the follow code will work. It “appears” to work with the first 50 numbers or so. I just want to make sure it will work no matter how big the number is:

static bool IsPrime(int number)
{
    if ((number == 2) || (number == 3) || (number == 5) || (number == 7) || (number == 9))
            return true;

    if ((number % 2 != 0) && (number % 3 != 0) && (number % 5 != 0) &&
        (number % 7 != 0) && (number % 9 != 0) && (number % 4 != 0) &&
        (number % 6 != 0))
        return true;

        return false;
 }
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-15T20:11:46+00:00Added an answer on May 15, 2026 at 8:11 pm

    No it won’t work! Try 121 = 11 * 11 for example which obviously isn’t a prime.

    For any number given to your function, that is a product of the prime numbers X1, X2, ..., Xn(where n >= 2) with all of them being greater or equal to 11, your function will return true. (And also, as already said, 9 isn’t a prime).

    From wikipedia you can see that:

    In mathematics, a prime number (or a prime) is a natural number that has exactly two distinct natural number divisors: 1 and itself.

    so a very simple and naive algorithm on checking whether a number is prime could be:

    public bool CalcIsPrime(int number) {
    
        if (number == 1) return false;
        if (number == 2) return true;
    
        if (number % 2 == 0) return false; // Even number     
    
        for (int i = 2; i < number; i++) { // Advance from two to include correct calculation for '4'
           if (number % i == 0) return false;
        }
    
        return true;
    
    }
    

    For better algorithms check here: Primality Test

    If you want to check your code, do inlcude a test, here’s a test case written in xunit.

            [Theory]
            [MemberData(nameof(PrimeNumberTestData))]
            public void CalcIsPrimeTest(int number, bool expected) {
                Assert.Equal(expected, CalcIsPrime(number));
            }
    
            public static IEnumerable<object[]> PrimeNumberTestData() {
                yield return new object[] { 0, false };
                yield return new object[] { 1, false };
                yield return new object[] { 2, true };
                yield return new object[] { 3, true };
                yield return new object[] { 4, false };
                yield return new object[] { 5, true };
                yield return new object[] { 6, false };
                yield return new object[] { 7, true };
                yield return new object[] { 8, false };
                yield return new object[] { 9, false };
                yield return new object[] { 10, false };
                yield return new object[] { 11, true };
                yield return new object[] { 23, true };
                yield return new object[] { 31, true };
                yield return new object[] { 571, true };
                yield return new object[] { 853, true };
                yield return new object[] { 854, false };
                yield return new object[] { 997, true };
                yield return new object[] { 999, false };
            }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.