testgoldbach.java

黑洞的算法

public class TestGoldBach{
	public static void main(String args[]){
		int n = 1000;
		if ( ( n<=6 ) || (n % 2 != 0 )) return;
		MathTool mt = new MathImpl();
		
		for(int i = 2; i<n/2 ; ++i){
			if ( (mt.isPrime(i)) && (mt.isPrime(n-i)) ){
				System.out.println(n + " = " + i + " + " + (n-i));
			}
		}
	}
}