4 ms·
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 pro
by Tichy 19y ago
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.
- ChaitanyaSai 19y agoUsing the Goldbach Conjecture makes it easier.
- Spyckie 19y agostart small and work your way up? lets say 1>x>y and x+y<=4...
- deleted 19y ago[deleted]
- Tichy 19y agoUpdate: 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).