Java Program to check whether a number is prime or not.1 min read

This post covers the Java Program to check for the prime number.

Prime Number

A number is said to be a prime number if it is divisible by itself and 1. Example: 3, 5, 7, 11, 13, 17, 19, etc.

We take a boolean variable isPrime and assigned it to be true. Then we take the user input and start a for loop for i = 2 end the loop for i less than half of the number entered. i will increase by 1 after each iteration.

Inside for loop a temp variable will contain the remainder of each iteration. And then if statement will check for temp to be 0 that is if the remainder is zero, isPrime is set to false. If isPrime is true , the number is Prime number else not.

Java Program to check for the prime number


You can also learn:

Java Programs
Java Interview Programs