In Java, a prime number refers to a number greater than 1 that can only be divided evenly by 1 and itself. In other words, prime numbers cannot be divided by any other numbers apart from 1 and the number itself. For instance, 2, 3, 5, 7, 11, 13, 17, and so on, are examples of prime numbers. They possess the unique characteristic of being divisible solely by 1 and the number itself, without any other divisors.
Now, let’s examine a Java program to determine whether a given number is prime or not. In this program, we will define a number variable and subsequently verify its primality.
Program:
public class PrimeExample{ public static void main(String args[]){ int i,m=0,flag=0; int n=10;//it is the number to be checked m=n/2; if(n==0||n==1){ System.out.println(n+" is not prime number"); }else{ for(i=2;i<=m;i++){ if(n%i==0){ System.out.println(n+" is not prime number"); flag=1; break; } } if(flag==0) { System.out.println(n+" is prime number"); } }//end of else } }
Output:
10 is not a prime number