Check if a number is prime and optimize the code.

• Start by checking if the number is less than 2, in which case it is not prime.

• Iterate from 2 to the square root of the number and check if any of them ...read more

Class p1

{

Public static void main(String[]args)

{

int n = 3;

int count = 0;

for(int i = 1; i<=n; i++)

{

if(n%i==0)

{

Count ++;

}

}

if(count == 2)

{

System.out.println("It is a prime Number")

}

else

{

System.out.println...read more

Class p1

{

Public static void main(String[]args)

{

int n = 3;

int count = 0;

for(int i = 1; i<=n; i++)

{

if(n%i==0)

{

Count ++;

}

}

if(count == 2)

{

System.out.println("It is a prime Number")

}

else

{

System.out.printl...read more