Hi Guys. Im new to java. How do you write method that determines whether a number is a prime. It should displays all prime numbers less than 10,000.

MAGAGULA DF

Hi i am also looking for the same answer, if you have any info that could help me please let me know. thanx.

Not a GUI question :)

Prime number has only two divisors(1 and the number itself). So number i isn't prime if it divides on any number less than i/2 without the remainder. The algorithm of checking either number is prime or not is based on that.

For the Java particulary I suggest method below:

 public void isPrime(int i) {
    int isPrime = 0;
    for (int j = 2; j <= i/2; j++) {
      if (i%j == 0) {
         isPrime = 1;
         break;
      }
    }
    if (isPrime == 0) System.out.println(i);
  }

Thanx, shame i didnt expect you to right the program for me but atleast now i can learn from it for my next program..im really battling with my quistions. i just wish my lecturer would respond to my questions...its quite difficult to learn java on your own.thanx again