ゴールドバッハの予想のJavaプログラム

import java.util.*;

public class GoldbachConjecture {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the even number to find its two prime summands:");
        int n = sc.nextInt();
        if (n % 2 != 0 || n <= 2) {
            System.out.println("Invalid input!");
            return;
        }
        findPrimeSummands(n);
    }

    public static void findPrimeSummands(int n) {
        for (int i = 2; i <= n / 2; i++) {
            if (isPrime(i)) {
                int j = n - i;
                if (isPrime(j)) {
                    System.out.println(n + " = " + i + " + " + j);
                }
            }
        }
    }

    public static boolean isPrime(int n) {
        if (n == 2) {
            return true;
        }
        if (n < 2 || n % 2 == 0) {
            return false;
        }
        for (int i = 3; i <= Math.sqrt(n); i += 2) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }
}