Prime number program in Java.

Following is the required program.

Example

Live Demo

public class Tester {
   public static void main(String args[]) {
      int i, m = 0, flag = 0;
      int n = 41;// it is the number to be checked
      m = n / 2;
      if (n == 0 || n == 1) {
         System.out.println(n + " not a prime number");
      } else {
         for (i = 2; i <= m; i++) {
            if (n % i == 0) {
               System.out.println(n + " not a prime number");
               flag = 1;
               break;
            }
         }
         if (flag == 0) {
            System.out.println(n + " is a prime number");
         }
      }
   }
}

Output

41 is a prime number.

V Jyothi

Updated on 18-Jun-2020 07:00:54

• Related Questions & Answers
• Java program to print a prime number
• Java Program to display a prime number less than the given number
• Python Program to Check Prime Number
• Java Program to find largest prime factor of a number
• Recursive program for prime number in C++
• Java program to check for prime and find next Prime in Java
• Java Program to Check Whether a Number is Prime or Not
• Different Methods to find Prime Number in Java
• Java Program to find Product of unique prime factors of a number
• Different Methods to find Prime Number in Python Program
• Mersenne Prime Number in C++.
• Python Program to Find if a Number is Prime or Not Prime Using Recursion
• k-th prime factor of a given number in java
• Prime factors in java
• Java program to print prime numbers below 100