Is it possible to split the set of 14 consecutive cubes $1^3,2^3,\ldots,14^3$ into two subsets of equal sums?
There has to be a more efficient approach than brute force, right? Because with brute force, you'd have to try a ridiculous amount of combinations... I posted a similar question a few days earlier, found here: Sums of Consecutive Cubes (Trouble Interpreting Question)
However, this problem is much harder, or at least has many more combinations to try, because there is no longer the condition that the two subsets have to have the same number of elements.
I would appreciate any and all help.
Thanks
Edit: Originally, I wanted to deal with the first 13 consecutive cubes, but as André Nicolas pointed out, it would not be possible given that the first 13 cubes sum to an odd value.