Prime Number Or Not In Java Using Scanner

This article will guide you through writing a Java program to determine if a given number is prime or not. You will learn how to use the Scanner class for input and implement a common algorithm for prime number checking.

Problem Statement

Determining whether a number is prime is a fundamental problem in computer science and mathematics. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. Efficiently checking for primality is crucial in various applications, such as cryptography and number theory.

Example

If the user enters 7, the program should output:

7 is a prime number.

If the user enters 10, the program should output:

10 is not a prime number.

Background & Knowledge Prerequisites

To understand this article, you should have a basic understanding of:

• Java syntax: Variables, data types, conditional statements (if-else), loops (for, while).
• Operators: Arithmetic operators, comparison operators.
• Scanner class: How to read input from the console.

Use Cases or Case Studies

• Cryptography: Prime numbers are the backbone of many cryptographic algorithms, such as RSA, which rely on the difficulty of factoring large numbers into their prime components.
• Number Theory Research: They are fundamental objects of study in number theory, with many unsolved problems related to their distribution and properties.
• Hashing Algorithms: Some hashing functions use prime numbers to distribute data more evenly and reduce collisions.
• Random Number Generation: Prime numbers can be used in certain algorithms for generating pseudo-random numbers.
• Educational Tools: Simple prime number checkers are often used as introductory programming exercises to teach concepts like loops and conditionals.

Solution Approaches

We will explore a common and efficient approach to check for prime numbers.

Approach 1: Iterating up to the Square Root

This approach optimizes the primality test by checking for divisors only up to the square root of the given number.

• One-line summary: Checks for divisibility from 2 up to the square root of the number.

// Prime Number Checker
import java.util.Scanner;

// Main class containing the entry point of the program
public class Main {
    public static void main(String[] args) {
        // Step 1: Create a Scanner object to read user input
        Scanner scanner = new Scanner(System.in);

        // Step 2: Prompt the user to enter a number
        System.out.print("Enter a number: ");
        int number = scanner.nextInt();

        // Step 3: Initialize a boolean flag to track primality
        boolean isPrime = true;

        // Step 4: Handle special cases for numbers less than or equal to 1
        if (number <= 1) {
            isPrime = false;
        } else {
            // Step 5: Iterate from 2 up to the square root of the number
            // If any number in this range divides 'number' evenly, it's not prime
            for (int i = 2; i * i <= number; i++) {
                if (number % i == 0) {
                    isPrime = false;
                    break; // No need to check further, it's not prime
                }
            }
        }

        // Step 6: Print the result based on the isPrime flag
        if (isPrime) {
            System.out.println(number + " is a prime number.");
        } else {
            System.out.println(number + " is not a prime number.");
        }

        // Step 7: Close the scanner to prevent resource leaks
        scanner.close();
    }
}

Run

• Sample output:

  Enter a number: 13
  13 is a prime number.

Enter a number: 9
    9 is not a prime number.

Enter a number: 1
    1 is not a prime number.

• Stepwise explanation:

1. Import Scanner: We import the java.util.Scanner class to enable reading input from the console.
2. Create Scanner object: An instance of Scanner is created, linked to System.in (standard input).
3. Get input: The program prompts the user to enter an integer and reads it using scanner.nextInt().
4. Initialize isPrime: A boolean variable isPrime is set to true by default, assuming the number is prime until proven otherwise.
5. Handle edge cases: Numbers less than or equal to 1 are not prime, so isPrime is set to false for these cases.
6. Loop for divisors: For numbers greater than 1, a for loop iterates from i = 2 up to i * i <= number. This is an optimization because if a number n has a divisor greater than its square root, it must also have a divisor smaller than its square root.
7. Check divisibility: Inside the loop, number % i == 0 checks if number is perfectly divisible by i.
8. Update isPrime and break: If a divisor is found, isPrime is set to false, and the break statement exits the loop early because we already know the number is not prime.
9. Print result: After the loop, the program prints whether the number is prime or not based on the final value of isPrime.
10. Close Scanner: It's good practice to close the Scanner object to release system resources.

Conclusion

Checking if a number is prime is a fundamental programming task. By understanding the definition of a prime number and implementing an efficient algorithm like iterating up to the square root, you can write a robust prime number checker in Java. The Scanner class provides a straightforward way to get user input, making your programs interactive.

Summary

• A prime number is a natural number greater than 1 with no positive divisors other than 1 and itself.
• The Scanner class is used to read user input from the console.
• Numbers less than or equal to 1 are not prime.
• An efficient way to check for primality is to iterate from 2 up to the square root of the number.
• If any number in this range divides the given number evenly, it is not prime.
• Always close Scanner objects to prevent resource leaks.