import java.util.Scanner;
public class _2262 {
public static boolean isPrime(int num){
for(int i = 3; i * i <= num; i += 2){
if (i * (num/i) == num)return false;
}
return true;
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n;
while((n=sc.nextInt())!=0){
for(int i = 3; i <= n / 2; i+= 2){
if(isPrime(i) && isPrime(n-i)){
System.out.printf("%d = %d + %d\n", n, i, n - i);
break;
}
}
}
}
}
小结:
1.筛法求素数会出现RE;
2.根本不需要“Goldbach's conjecture is wrong”;
3.奇素数。