Java作业 验证哥德巴赫猜想

package helloworld;

import java.util.Scanner;

public class PrimeNubmer {

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

  public static void main(String[] args) {
    int cnt = 0;
    Scanner cin = new Scanner(System.in);
    int n = cin.nextInt();
    for (int i = 1; i <= n / 2; i++) {
      if (isPrime(i) && isPrime(n - i))
        System.out.println(i + "+" + (n - i) + "=" + n);
    }
  }
}