Java Program to Find Prime Factor

Posted in Java Tutorial

Updated on Oct 30, 2024

By Mari Selvan

👁️ 80 - Views

⏳ 4 mins

💬 1 Comment

Photo Credit to CodeToFun

🙋 Introduction

In the realm of programming, understanding the prime factors of a number is a fundamental task. Prime factors are the prime numbers that multiply together to give the original number.

Checking for prime factors involves determining whether a given number is divisible by prime numbers.

In this tutorial, we will explore a Java program designed to check the prime factors of a given number.

The program involves identifying and displaying the prime factors of the specified number.

📄 Example

Let's delve into the Java code that accomplishes this task.

PrimeFactorChecker.java

Copied

import java.util.Scanner;

public class PrimeFactorChecker {
  // Function to check if a number is a prime factor
  static boolean isPrimeFactor(int number, int divisor) {
    // Check if the divisor is a prime factor of the number
    return (number % divisor == 0);
  }

  // Function to display prime factors of a number
  static void displayPrimeFactors(int number) {
    System.out.print("Prime factors of " + number + " are: ");

    // Iterate through numbers to find prime factors
    for (int i = 2; i <= number; ++i) {
      // Check if i is a prime factor and divides the number
      while (isPrimeFactor(number, i)) {
        System.out.print(i + " ");
        number /= i;
      }
    }
    System.out.println();
  }

  // Driver program
  public static void main(String[] args) {
    // Replace this value with the number you want to find prime factors for
    int number = 56;

    // Call the function to display prime factors
    displayPrimeFactors(number);
  }
}

💻 Testing the Program

To test the program with different numbers, modify the value of number in the main method.

Output

Prime factors of 56 are: 2 2 2 7

Compile and run the program to display the prime factors of the specified number.

🧠 How the Program Works

The program defines a class PrimeFactorChecker containing a static method isPrimeFactor that takes two integers, number and divisor, and returns true if divisor is a prime factor of number, and false otherwise.
The static method displayPrimeFactors iterates through numbers to find prime factors of the given number and prints them.
Inside the main method, replace the value of number with the desired number you want to find prime factors for.
The program calls the displayPrimeFactors method to find and display prime factors.

🧐 Understanding the Concept of Odd Number

Before delving into the code, let's understand the concept of prime factors. Prime factors are prime numbers that multiply together to give the original number.