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

  • SEARCH
  • Home
  • 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 6805979
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T19:39:15+00:00 2026-05-26T19:39:15+00:00

I’m trying to sort out some homework regarding repetition with the while statement. The

  • 0

I’m trying to sort out some homework regarding “repetition” with the while statement. The homework is asking me to input a number and tell if said number is prime. So far, I’ve come with this:

class Prime {
    boolean esPrime(int n) {
        boolean prime = true;
        int divisor = 2;
        while (prime && divisor != n) {
            if (n % divisor == 0) {
                prime = false;
            } else {
                divisor++;
            }
        }

        return prime;
    }
}

Then I stated this “boolean test” in the main method to check if that piece of code worked:

boolean testEsPrime = esPrime(2) == false;

public static void main(String[] args) {
    Prime p = new Prime();
    System.out.println("testEsPrime = " + p.testEsPrime);
}

And whenever I run it I get false and I can’t seem to be able to spot the error. Any clue why this happens?

  • 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-26T19:39:15+00:00Added an answer on May 26, 2026 at 7:39 pm

    It’s not the most efficient code in the world, but it works for me (see below). I’m not sure what the problem is here! Incidentally, you only need to test 2 and odd factors up to the square root of the thing you’re testing, and a more efficient approach in general (for determining what numbers are primes in bulk) is to use a Sieve of Erastothenes (http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes).

    The reason you get false for the test you do is that esPrime(2) == false is false – that is, esPrime(2) == true.

    class Prime {
        boolean esPrime(int n) {
            boolean prime = true;
            int divisor = 2;
            while (prime && divisor != n) {
                if (n % divisor == 0) {
                    prime = false;
                }
                else {
                    divisor++;
                }
            }
            return prime;
        }
    
        public static void main(String[] args) {
            Prime p = new Prime();
            for(int i=2; i<10; ++i) {
                System.out.println("esPrime(" + i + ") = " + p.esPrime(i));
            }
        }
    }
    

    Output:

    esPrime(2) = true
    esPrime(3) = true
    esPrime(4) = false
    esPrime(5) = true
    esPrime(6) = false
    esPrime(7) = true
    esPrime(8) = false
    esPrime(9) = false

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm trying to decode HTML entries from here NYTimes.com and I cannot figure out
I'm trying to create an if statement in PHP that prevents a single post
I am trying to understand how to use SyndicationItem to display feed which is
Basically, what I'm trying to create is a page of div tags, each has
link Im having trouble converting the html entites into html characters, (&# 8217;) i
I have just tried to save a simple *.rtf file with some websites and
For some reason, after submitting a string like this Jack’s Spindle from a text
I have a string like this: La Torre Eiffel paragonata all&#8217;Everest What PHP function
I'm parsing an RSS feed that has an &#8217; in it. SimpleXML turns this
I need to clean up various Word 'smart' characters in user input, including but

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.