Hi Friend,

Try the following code:

import java.util.*;

class CheckPrime{
    static boolean isPrime(int number){
        boolean isPrime = false;
        int i = (int) Math.ceil(Math.sqrt(number));
        while (i > 1) {
        if((number != i) && (number % i == 0)) {
            isPrime = false;
            break;
            } else if (!isPrime)
            isPrime = true;
            --i;
        }
        return isPrime;
    }
    public static void main(String[] args){
            int num = 5;
            if (isPrime(num)) {
                    System.out.println("Number is Prime");
                }
                else{
                    System.out.println("Number is not Prime");
                }
    }
}

Thanks