Java Basic
Java Interview Programs
- Java Interview Programs
- Java Abundant Number
- Java Amicable Number
- Java Armstrong Number
- Java Average of N Numbers
- Java Automorphic Number
- Java Biggest of three numbers
- Java Binary to Decimal
- Java Common Divisors
- Java Composite Number
- Java Condense a Number
- Java Cube Number
- Java Decimal to Binary
- Java Decimal to Octal
- Java Disarium Number
- Java Even Number
- Java Evil Number
- Java Factorial of a Number
- Java Fibonacci Series
- Java GCD
- Java Happy Number
- Java Harshad Number
- Java LCM
- Java Leap Year
- Java Magic Number
- Java Matrix Addition
- Java Matrix Division
- Java Matrix Multiplication
- Java Matrix Subtraction
- JS Matrix Transpose
- Java Maximum Value of an Array
- Java Minimum Value of an Array
- Java Multiplication Table
- Java Natural Number
- Java Number Combination
- Java Odd Number
- Java Palindrome Number
- Java Pascalβs Triangle
- Java Perfect Number
- Java Perfect Square
- Java Power of 2
- Java Power of 3
- Java Pronic Number
- Java Prime Factor
- Java Prime Number
- Java Smith Number
- Java Strong Number
- Java Sum of Array
- Java Sum of Digits
- Java Swap Two Numbers
- Java Triangular Number
Java Program to Check Prime Number
Photo Credit to CodeToFun
π Introduction
In the landscape of programming, dealing with prime numbers is a fundamental and interesting task. Prime numbers, those divisible only by 1 and themselves, play a crucial role in various mathematical and computational applications.
In this tutorial, we'll explore a Java program that efficiently checks whether a given number is a prime number.
π Example
Let's examine the Java code that performs the prime number check.
public class PrimeChecker {
// Function to check if a number is prime
static boolean isPrime(int number) {
// 0 and 1 are not prime numbers
if (number <= 1) {
return false;
}
// Check for factors from 2 to the square root of the number
for (int i = 2; i * i <= number; ++i) {
if (number % i == 0) {
return false; // Found a factor, not a prime number
}
}
return true; // No factors found, it's a prime number
}
// Driver program
public static void main(String[] args) {
// Replace this value with your desired number
int testNumber = 17;
// Call the function to check if the number is prime
if (isPrime(testNumber)) {
System.out.println(testNumber + " is a prime number.");
} else {
System.out.println(testNumber + " is not a prime number.");
}
}
}
π» Testing the Program
To test the program with a different number, replace the value of testNumber in the main method.
17 is a prime number.
Compile and run the program to see whether the number is a prime number.
π§ How the Program Works
- The program defines a class PrimeChecker containing a static method isPrime that takes an integer as input and returns a boolean indicating whether the number is prime.
- Inside the method, it checks if the number is less than or equal to 1; if so, it's not prime.
- It then iterates through potential factors from 2 to the square root of the number.
- If it finds any factor, the number is not prime; otherwise, it is prime.
- The main method tests the program with a specific number (in this case, 17).
π Between the Given Range
Let's dive into the java code that checks and lists prime numbers in the specified range.
public class PrimeNumberChecker {
// Function to check if a number is prime
static boolean isPrime(int number) {
if (number <= 1) {
return false;
}
for (int i = 2; i <= Math.sqrt(number); i++) {
if (number % i == 0) {
return false;
}
}
return true;
}
// Driver program
public static void main(String[] args) {
System.out.print("Prime Numbers in the Range 1 to 20: ");
// Check prime numbers in the range 1 to 20
for (int i = 1; i <= 20; i++) {
if (isPrime(i)) {
System.out.print(i + " ");
}
}
System.out.println();
}
}
π» Testing the Program
The program is set to check and list prime numbers in the range from 1 to 20. No additional input is required.
Prime Numbers in the Range 1 to 20: 2 3 5 7 11 13 17 19
Compile and run the program to see the prime numbers in the specified range.
π§ How the Program Works
- The program defines a class PrimeNumberChecker containing a static method isPrime that checks if a number is prime.
- Inside the isPrime method, it iterates from 2 to the square root of the number to check for factors.
- The main method tests the prime numbers in the range from 1 to 20 and prints the result.
π§ Understanding the Concept of Prime Numbers
Before diving into the code, let's briefly understand prime numbers.
A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. For example, 2, 3, 5, 7, 11, and 13 are prime numbers.
π’ Optimizing the Program
While the provided program is effective, you can explore optimizations such as using the square root of the number as the loop limit for improved efficiency.
Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (Java Program to Check Prime Number), please comment here. I will help you immediately.