Chapter 6.6, Problem 6.6.2CP

Explanation of Solution

//Method definition "isPrime"

public static boolean isPrime(int number)

{

//For loop to check the condition

for (int divisor = 2; divisor <=number/2; divisor++)

{

/*Check whether "number" mod "divisor" equals to 0*/

if (number % divisor==0)

{

//Return false

return false;

}

}

//Return  true

return true;

    }

}

...