Prime Checker Java Coding, Java Beginners Prime_number

I have this Prime Checking Java coding problem:

A prime number ‘p’ is a positive integer (p>1) that can only be divided evenly by:
a) ‘p’ Itself (so the result of the division is: p/p = 1)
b) 1 (so the result of the division is p/1 = p)

The first few prime numbers are:

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31

Write a Class PrimeChecker that has checkPrime() method as follows:

public class PrimeChecker {

public static boolean checkPrime(int anyNumber){

// write your logic here
}

public static void main(String[] args) {
boolean found = false;
for (int p=-5; p<35;p++){
found = checkPrime(p);
if (found){
System.out.print(p + "\t");
}
}
}
}

Obviously, the method checkPrime will take in any integer and return true of false depending on whether integer is Prime or not.

As a tester for your code, the main method is sending a series of integers to the checkPrime method.

Here is the expected output:

2 3 5 7 11 13 17 19 23 29 31

Thanks.

Posted by Cris on Monday, 03.10.08 @ 04:58am | #52148