4 ms·
You only need to enumerate pairs of integers, the 3rd is then forced (quickly check if it's a cube).
by robrenaud 7y ago
You only need to enumerate pairs of integers, the 3rd is then forced (quickly check if it's a cube).
- swolchok 7y ago2^109 nanoseconds is still 150,000 times older than the universe. If you do manage to get a trillion computers, you can now solve the problem in twenty thousand years. It's still intractable.
- ChrisLomont 7y agoYou’re assuming a fixed target. I was enumerating which targets get hit to solve the problem for all cubes up to some fixed size. If you’re assuming a fixed target, you don’t know how large you need to check to find an answer. That 53 bit numbers sufficed for 42 was not known in advance, and is not the bound for other targets.