//  Data Structures with Java by John R. Hubbard
//  Copyright McGraw-Hill, 2001
//  Problem 2.27 on page 50
//  Testing the Goldbach Conjecture

import schaums.dswj.Primes;

public class Pr0227
{ public static void main(String[] args) 
  { final int N=10000;
    Primes.setSize(N);
    System.out.println("4 = 2+2");
    for (int n=6; n<100; n += 2)
    { System.out.print(n);
      for (int p=3; p<=n/2; p += 2)
        if (Primes.isPrime(p) && Primes.isPrime(n-p))
          System.out.print(" = "+p+"+"+(n-p));
      System.out.println();
    }
  }
}