Java program to check if a number is prime or not

import java.util.Scanner;
class PrimeCheck
{
   public static void main(String args[])
   {
	int temp;
	boolean isPrime=true;
	Scanner scan= new Scanner(System.in);
	System.out.println("Enter any number:");
	//capture the input in an integer
	int num=scan.nextInt();
        scan.close();
	for(int i=2;i<=num/2;i++)
	{
           temp=num%i;
	   if(temp==0)
	   {
	      isPrime=false;
	      break;
	   }
	}
	//If isPrime is true then the number is prime else not
	if(isPrime)
	   System.out.println(num + " is a Prime Number");
	else
	   System.out.println(num + " is not a Prime Number");
   }
}

OUTPUT:

Enter any number:
19
19 is a Prime Number
Enter any number:
6
6 is not a Prime Number

Sharing Is Caring