# Prime Number in Java

Published on 28 April 2022 (Updated: 02 February 2023) Welcome to the Prime Number in Java page! Here, you’ll find the source code for this program as well as a description of how the program works.

## Current Solution

``````class PrimeNumberException extends Exception {
}

public static boolean isPrime(int number) {
if ((number % 2 == 0 && number != 2) || number == 1) {
return false;
}

boolean foundFactor = false;
for (int n = 3; n <= (int) Math.ceil(Math.sqrt(number)); ++n) {
if ((number % n) == 0) {
foundFactor = true;
break;
}
}
return !foundFactor;
}

public static void main(String[] args) {
try {

if (args.length < 1 || args.indexOf('-') != -1) {
}

if (isPrime(Integer.valueOf(args))) {
System.out.println("Prime");

} else {
System.out.println("Composite");
}

} catch (NumberFormatException | PrimeNumberException e) {
System.err.println("Usage: please input a non-negative integer");
}
}
}
``````

Prime Number in Java was written by:

• Ewerton Queiroz
• Ganesh Naik
• Jeremy Grifski
• Juan D Frias

If you see anything you’d like to change or update, please consider contributing.

Note: The solution shown above is the current solution in the Sample Programs repository as of Oct 10 2022 15:04:56. The solution was first committed on Oct 10 2019 02:15:05. As a result, documentation below may be outdated.

## How to Implement the Solution

No ‘How to Implement the Solution’ section available. Please consider contributing.

## How to Run the Solution

No ‘How to Run the Solution’ section available. Please consider contributing.