write a program to find whether the number is prime or not.

Answer 1

public static boolean isPrime(int n) {
if (n < 2) {
return false;
}
for (int i = 2; i <= Math.sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}

Answer 2

if no. is divisible by 2,3,5, and 7, i.e. remainder 0,,print "not prime"..else otherwise..

Answer 3

public static void main(int n)
{
if(n%2==0)
System.out.println(" the no. is not prime") ;
else
System.out.println(" the no. is prime");
}

Answer 4

zara difficult questions karo na aap :/ :/