福州青口汽车城:如何用JAVA验证歌德巴赫猜想？

public class Primes
{

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

public static int[] arrayOfPrimes(int i)
{
int[] primes = new int[i];
int num = 0;
for( int m = 2; m<= i; m++)
{
if(Primes.isPrime(m))
{
primes[num] = m;
num++;
}
}
return primes;
}

public static void main(String [] args)
{
for( int target = 6; target <= 100; target += 2)
{
int[] arrayOfPrimes = Primes.arrayOfPrimes(target);
for(int i = 0; i < target; i++)
{
int test = arrayOfPrimes[i];
if (Primes.isPrime (target-test))
{
System.out.println(target + " = " + test + " + " + (target-test));
break;
}
}
}
}
}