How to check a number is prime or not prime in java

  • admin on February 4, 2019
  • Likes!
Hello friends! Welcome to my website

Today We Run a program to check prime number in Java.
This session is how to check the number is prime or not in Java Programming. Here we find in the multiple numbers what number is prime and what number is not prime  in java programming with Example
This Java language programming is free all type of errors like the compiler and runtime errors and this programming is tested to compile and then run the program code.
Here is only programming code with the output. This programming output is customized to understand easily.

How to the Find prime number in Java Programming

class newprime {
    int n;
    public void isprime(int n) {
        int i, m = 0, f = 0;
        m = n / 2;
        if (n == 0 || n == 1) {
            System.out.println(n + ” is not prime number”);
        } else {
            for (i = 2; i                 if (n % i == 0) {
                    System.out.println(n + ” is not prime number”);
                    f = 1;
            if (f == 0) {
                System.out.println(n + ” is prime number”);
public class prime {
    public static void main(String[] args) {
        newprime o = new newprime();

Output:   3 is prime number
4 is not prime number
5 is prime number

I make this programming and hope you are like the post if are you like the post you can please comment and Share the post to reach more people.
If any doubt about this java programming code or input & output please comment below
If you have another question about Java programming send an email by contacting us form are given on the page right side.
I am Try to Help in your Programming Language by Programming Shortcuts

Please share your experience about this post,
Thank You!

Article Categories:
Programs in java

Leave a Reply

Your email address will not be published. Required fields are marked *