Perfect Number Or Not Program In Java

A perfect number is a positive integer that is equal to the sum of its proper positive divisors (divisors excluding the number itself). For example, 6 is a perfect number because its proper divisors are 1, 2, and 3, and 1 + 2 + 3 = 6. In this article, you will learn how to write a Java program to determine if a given number is a perfect number.

Problem Statement

The challenge is to develop a Java program that can take an integer input from the user and efficiently check if it meets the definition of a perfect number. This involves finding all proper divisors of the number and summing them up, then comparing this sum to the original number.

Example

If the input number is 28, the program should output that 28 is a perfect number. The proper divisors of 28 are 1, 2, 4, 7, 14. Their sum is 1 + 2 + 4 + 7 + 14 = 28.

Background & Knowledge Prerequisites

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

• Java syntax and data types (integers).
• Conditional statements (if-else).
• Looping constructs (for loop).
• Basic input/output operations using Scanner.
• The concept of divisors and sums.

Use Cases or Case Studies

• Educational Tools: Teaching number theory concepts in a programming context.
• Mathematical Research: Exploring properties of numbers and algorithms for number classification.
• Coding Challenges: A common problem in introductory programming contests.
• Algorithm Practice: Demonstrating basic algorithm design for divisor calculation.

Solution Approaches

Approach 1: Brute-Force Iteration

This approach involves iterating from 1 up to (number - 1) to find all proper divisors and summing them.

• One-line summary: Iterate through all numbers from 1 to n-1, check for divisibility, and sum the divisors.

// Perfect Number Checker (Brute-Force)
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 positive integer: ");
        int number = scanner.nextInt();

        // Step 3: Initialize sum of divisors
        int sumOfDivisors = 0;

        // Step 4: Check if the number is positive
        if (number <= 0) {
            System.out.println("Please enter a positive integer.");
        } else {
            // Step 5: Iterate from 1 up to (number - 1) to find proper divisors
            for (int i = 1; i < number; i++) {
                if (number % i == 0) { // If 'i' is a divisor
                    sumOfDivisors += i; // Add 'i' to the sum
                }
            }

            // Step 6: Compare the sum of divisors with the original number
            if (sumOfDivisors == number) {
                System.out.println(number + " is a perfect number.");
            } else {
                System.out.println(number + " is not a perfect number.");
            }
        }

        // Step 7: Close the scanner
        scanner.close();
    }
}

Run

Sample Output:

Enter a positive integer: 6
6 is a perfect number.

Stepwise Explanation:

1. Input: The program takes an integer number from the user.
2. Initialization: A variable sumOfDivisors is initialized to 0.
3. Validation: It checks if the input number is positive. Perfect numbers are defined for positive integers.
4. Looping for Divisors: A for loop runs from i = 1 up to number - 1.
5. Divisibility Check: Inside the loop, number % i == 0 checks if i divides number evenly. If it does, i is a proper divisor.
6. Summation: If i is a divisor, it's added to sumOfDivisors.
7. Comparison: After the loop, sumOfDivisors is compared to the original number.
8. Output: Based on the comparison, the program prints whether the number is perfect or not.

This approach optimizes the divisor finding process by iterating only up to the square root of the number. If i is a divisor of n, then n/i is also a divisor.

• One-line summary: Iterate up to sqrt(n), find pairs of divisors, and sum them. Handle perfect squares carefully.

``java // Program Title: Perfect Number Checker (Optimized) 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 positive integer: "); int number = scanner.nextInt();

// Step 3: Initialize sum of divisors (start with 1 as it's always a divisor) int sumOfDivisors = 1; // 1 is always a proper divisor for numbers > 1

// Step 4: Check if the number is positive if (number <= 0) { System.out.println("Please enter a positive integer."); } else if (number == 1) { // 1 is not a perfect number System.out.println("1 is not a perfect number."); } else { // Step 5: Iterate from 2 up to the square root of the number for (int i = 2; i * i <= number; i++) { if (number % i == 0) { // If 'i' is a divisor sumOfDivisors += i; // Add 'i' if (i * i != number) { // If 'i' is not the square root, add its pair sumOfDivisors += (number / i); } } }

// Step 6: