Re:Sum-of-Three-Cubes Problem Solved for ‘Stubborn’ Number 33
by qlk1123 on Thursday March 28, 2019 @06:17PM
(#19517190)
> But I don't see anything that's stopping a GPU from efficiently computing THIS problem, especially if its restricted to 192-bit as the biggest number in the whole algorithm (worst-case 64-bit cubed).
Fair enough. Also thanks for the demonstration, it updates my understanding.
But still at some moment in the future, we may need a general big-number algorithms for calculation due to the inevitable expansion of search space. There is no guarantee that unsolved
k's, says 100 < k < 200, can be found in min(|x|,|y|,|z|) <= 192 bit.
> But THIS sum-of-three cubes problem looks like an easier job than most algorithms to me.
Good luck and I'm looking forwards to any updates.
Fair enough. Also thanks for the demonstration, it updates my understanding.
But still at some moment in the future, we may need a general big-number algorithms for calculation due to the inevitable expansion of search space. There is no guarantee that unsolved k's, says 100 < k < 200, can be found in min(|x|,|y|,|z|) <= 192 bit.
> But THIS sum-of-three cubes problem looks like an easier job than most algorithms to me.
Good luck and I'm looking forwards to any updates.