Java Program to determine whether the number is Prime or not

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. In simpler terms, a prime number is a number that is divisible only by 1 and itself, with no other factors. For example, 2, 3, 5, 7, 11, and 13 are prime numbers, as they cannot be divided evenly by any other number.

Understanding the Code:

1.   The code initializes a variable number with a sample value (7 in this case) and a boolean variable isPrime to true.

2.   If the number is less than 2, it is not prime (as prime numbers start from 2), so isPrime is set to false. Otherwise, the code enters a loop to check if the number is divisible by any integer between 2 and the number itself minus 1.

3.   Inside the loop, the code checks if the number is divisible by the current index. If it is, isPrime is set to false, indicating that the number is not prime, and the loop breaks.

4.   Finally, the code prints whether the number is prime or not based on the value of isPrime.

public class PrimeNumber {


    public static void main(String[] args) {
       
        int number=7;


        boolean isPrime=true;


        if(number<2){
            isPrime=false;
        }
        else{


            for(int index=2;index<=number-1;index++){
                    if(number%index==0){
                        isPrime=false;
                        break;
                    }
                 
            }



        }
        if(isPrime){
            System.out.println(number+" is a Prime Number");
        }
        else{
            System.out.println(number+" is not a Prime Number");
        }



    }
   
}