News for hackers. Stuff that matters.
Re:Classic math puzzles for job interviews by Tichy on Wednesday March 12, 2008 @06:21PM (#135540)
I haven't solved it yet, but it seems to be solvable by sheer diligence? Is there a faster solution? I think in an interview I would ask to write a computer program that solves it. Wait - I guess now I have to try that :-(

Edit: which programming language has good support for primes? I thought I saw one recently, but can't find it now.

Re:Classic math puzzles for job interviews by Tichy on Sunday March 16, 2008 @07:26PM (#138505)
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.
Re:Classic math puzzles for job interviews by Spyckie on Thursday March 13, 2008 @01:16AM (#135766)
start small and work your way up?

lets say 1>x>y and x+y<=4...