program to check no. is prime or not in java using boolean datatypes.
import java.util.*;
public class prime {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
System.out.println("enter a number=");
int n = sc.nextInt();
boolean isPrime = true;
for(int i=2; i<=n/2; i++) {
if(n % i == 0) {
isPrime = false;
break;
}
}
if(isPrime) {
if(n == 1) {
System.out.println("This is neither prime
not composite");
} else {
System.out.println("This is a prime
number.");
}
} else {
System.out.println("This is not a prime
number");
}
}
}
outout->
enter a number=7
This is a prime number.
Comments
Post a Comment