Update: OK, now I wrote the program, and in hindsight it was overkill. Just check the candidates for x+y starting from below, and the right solution appears pretty quickly (there are 24 candidates for x+y, but it is not necessary to check them all).
Re:Classic math puzzles for job interviews
by ChaitanyaSai on Wednesday March 12, 2008 @07:41PM
(#135597)
Using the Goldbach Conjecture makes it easier.
Edit: which programming language has good support for primes? I thought I saw one recently, but can't find it now.