Prime Number Checker in Java Using BlueJ

 What are Prime Numbers? 

In math, prime numbers are whole numbers greater than 1, that have only two factors – 1 and the number itself.

Prime numbers are divisible only by the number 1 or itself.  

 For example, 2, 3, 5, 7 and 11 are the first few prime numbers.

Reference

https://www.splashlearn.com/math-vocabulary/algebra/prime-number

I am currently accepting programming work, IT projects, school and application development, programming projects, thesis and capstone projects, IT consulting work, computer tutorials, and web development work kindly contact me at the following email address for further details.  If you want to advertise on my website kindly contact me also in my email address also. Thank you.

My email address is the following jakerpomperada@gmail.com, jakerpomperada@aol.com, and jakerpomperada@yahoo.com.

My mobile number here in the Philippines is 09173084360.

My telephone number at home here in Bacolod City, Negros Occidental Philippines is  +63 (034) 4335675.

Here in Bacolod City I also accepting computer repair, networking, and Arduino Project development at a very affordable price. My website is www.jakerpomperada.blogspot.com and www.jakerpomperada.com

If you like this video please click the LIKE button, SHARE, and SUBSCRIBE to my channel.

Your support on my channel is highly appreciated.

Program Listing

// Prime_Number.java

// Jake Rodriguez Pomperada,MAED-IT, MIT

// www.jakerpomperada.blogspot.com  and www.jakerpomperada.com

// jakerpomperada@gmail.com

// Bacolod City, Negros Occidental Philippines

import java.util.Scanner;

public class Prime_Number {

    public static void main(String[] args) {

        

        Scanner scan = new Scanner(System.in);

        

              

        System.out.println();

        System.out.print("\tPrime Number Checker in Java Using BlueJ ");

        System.out.println("\n");

        System.out.print("\tEnter a Number : ");

        int num = scan.nextInt();

        

        

        boolean flag = false;

        for(int i = 2; i <= num/2; ++i)

        {

            if(num % i == 0)

            {

                flag = true;

                break;

            }

        }

         System.out.println("\n");

         

        if (!flag)

            System.out.println("\t" + num + " is a prime number.");

        else

            System.out.println("\t" + num + " is not a prime number.");

    }

}