Program for checking whether the number is prime or not

public class PrimeExample {

public static void main(String[] args) {

    int number;

    boolean flag = false;

    Scanner sc = new Scanner(System.in);

    System.out.println("Enter the number");

    number = sc.nextInt();

    for (int i = 2; i <= number / 2; i++) {

        if (number % i == 0) {

            flag = true;
            break;
        }
    }

    if (!flag) {

        System.out.println("Number is Prime");
    } else {

        System.out.println("Number is not Prime");
    }

 }
}

Design a site like this with WordPress.com
Get started