JAVA PROGRAM • LEVEL 04 — LOOPS & NUMBER PROBLEMS
Check a Prime Number in Java
Learn check a prime number in java with a complete, compiler-ready Java 17 example.
PROBLEM UNDERSTANDING
Input and expected output
No input required
true
COMPLETE JAVA 17 PROGRAM
Complete Java 17 implementation
class Main {
public static void main(String[] args) throws Exception {
int number = 29;
boolean prime = number > 1;
for (int divisor = 2; divisor * divisor <= number; divisor++)
if (number % divisor == 0) { prime = false; break; }
System.out.println(prime);
}
}CURRENT STEP
Select Start to walk through the important lines.
SELECTED LINE
No line selected
EXPECTED OUTPUT FOR THE SAMPLE
true
PROGRAM EXPLANATION
Algorithm and explanation
- Initialize the deterministic sample values used for check a prime number in java.
- Apply Prime test and Square-root bound in the order shown by the program.
- Print the final result and compare it with the documented sample output.
This Java 17 example demonstrates Prime test and Square-root bound through a complete, executable program. The values are intentionally small so students can trace each statement, verify the output, and then modify the example safely in the online compiler.
EFFICIENCY
Time and space complexity
O(√n)
O(1)
DEBUGGING CHECKLIST
Common mistakes
Keep the class name Main and the entry method signature public static void main(String[] args) when using the online compiler.
Check the loop boundary and update expression carefully to avoid skipping the final value or creating an infinite loop.
Java is case-sensitive, and every statement that requires a semicolon must end with one.