{"id":22556,"date":"2017-05-07T13:53:57","date_gmt":"2017-05-07T13:53:57","guid":{"rendered":"https:\/\/www.testingdocs.com\/questions\/?p=22556"},"modified":"2024-11-16T14:57:04","modified_gmt":"2024-11-16T14:57:04","slug":"java-program-to-check-whether-the-number-is-a-prime-number","status":"publish","type":"post","link":"https:\/\/www.testingdocs.com\/questions\/java-program-to-check-whether-the-number-is-a-prime-number\/","title":{"rendered":"Java Program to check Prime number"},"content":{"rendered":"

Overview<\/h1>\n

Let’s develop a Java program to check whether the number is a prime number or not in this tutorial. A prime number is a number that has no factors other than 1 and itself.<\/p>\n

Java Program<\/h2>\n

Install and launch Java IDE. For example, Eclipse.<\/p>\n

Create a Java class PrimeNumber<\/p>\n

Add the Java code to the class.<\/p>\n

\n
\n

package<\/span> com.testingdocs.programs;<\/span><\/p>\n

import<\/span> java.util.Scanner;<\/span><\/p>\n

\/*********************************************<\/span><\/p>\n

* Program <\/span>–<\/span> PrimeNumber.java <\/span><\/p>\n

Program Description:<\/span><\/p>\n

* Java Program to check whether a given number<\/span><\/p>\n

* is a prime or not<\/span><\/p>\n

* <\/span><\/p>\n

* Java Tutorials <\/span>–<\/span> www.TestingDocs.com<\/span><\/p>\n

********************************************\/<\/span><\/p>\n

public<\/span> class<\/span> PrimeNumber {<\/span><\/p>\n

public<\/span> static<\/span> void<\/span> main(String[] <\/span>args<\/span>) {<\/span><\/p>\n

try<\/span> {<\/span><\/p>\n

Scanner <\/span>keyboard<\/span> = <\/span>new<\/span> Scanner(System.<\/span>in<\/span>);<\/span><\/p>\n

System.<\/span>out<\/span>.println(<\/span>“Enter a number :=”<\/span>);<\/span><\/p>\n

int<\/span> n<\/span> = Integer.<\/span>parseInt<\/span>(<\/span>keyboard<\/span>.nextLine());<\/span><\/p>\n

Boolean <\/span>primeFlag<\/span> = <\/span>true<\/span>;<\/span><\/p>\n

for<\/span> (<\/span>int<\/span> i<\/span> = 2; <\/span>i<\/span> <= <\/span>n<\/span> \/ 2; <\/span>i<\/span>++) {<\/span><\/p>\n

if<\/span> (<\/span>n<\/span> % <\/span>i<\/span> == 0) {<\/span><\/p>\n

primeFlag<\/span> = <\/span>false<\/span>;<\/span><\/p>\n

break<\/span>;<\/span><\/p>\n

}<\/span><\/p>\n

} <\/span>\/\/ end of for<\/span><\/p>\n

if<\/span> (<\/span>primeFlag<\/span>)<\/span><\/p>\n

System.<\/span>out<\/span>.println(<\/span>“Given Number is a <\/span><\/p>\n

Prime Number”<\/span>);<\/span><\/p>\n

else<\/span><\/p>\n

System.<\/span>out<\/span>.println(<\/span>“Given Number is <\/span><\/p>\n

Not a Prime number”<\/span>);<\/span><\/p>\n

} <\/span>catch<\/span> (NumberFormatException <\/span>nfe<\/span>) {<\/span><\/p>\n

System.<\/span>out<\/span>.println(<\/span>” Invalid Input.”<\/span>);<\/span><\/p>\n

}<\/span><\/p>\n

} <\/span>\/\/ end of main<\/span><\/p>\n

}<\/span><\/p>\n

 <\/p>\n<\/div>\n<\/div>\n

\"Java<\/h2>\n

Explanation<\/h2>\n

The prime program does the following things:<\/p>\n