Quote:
Originally Posted by d2_e4
I'm in a bit of a rush so I'll come back to the rest of your post later, but just wanted to respond to this quickly. I mean that you said "some" zeroes are allowed, as long it makes the solution "interesting". In one of the examples you gave, you had nonzero terms except one. Obviously, I understand intuitively what you meant, but it's not a rigorous condition. For example, what if I came up with a number that is the sum of 2 squares, 2 cubes, 2 4th powers, 2 5th powers, 2 6th powers etc. and pad the rest with zeroes? Is that sufficiently "interesting"?
The answer to this of course is that which only a wise thinker chooses ie to research the damn this thoroughly. After the trivial a^(2*3*4*5*...) single nonzero element each time solution all is possibly interesting. So if you do other powers with multiple elements and one was with only a few or one i dont mind because some number will be 7th powers of course. That opens also the door to asking can a 7th power be described by say 7 7th power terms or less that are not the same as original(ie not the stupid thing) (Fermat generalization may be known even) . Take that to mean not 1 7th but 2 and higher.
But if you got 2 2 3 3 4 4 5 5 6 6 7 7 etc is a separate problem requiring all to be nonzero. You can choose that too. I want to make it easier to have some room for some zeroes. That makes it less strict.
When someone proposes something the correct thing is to try to generalize, improve it reframe it etc. Thats how good will people with genuine curiosity behave. This is not a pissing contest. It is an opportunity to learn.
Here is a conjecture i have since teenager.
Every number with the exception of a small set of less than 25 members (i think if recall correct search have to look programs or say no larger than 10000 i think and just reran them now to find the first exceptions are 15, 23, 55, 62, 71, 471, 510, 646, 806, 839, 879, 939, 1023, 1063, 1287, 2127, 5135, 6811, 7499, 9191, 26471) can be written as a^2+b^3+c^4+d^5 with a b c d non negative integers. I searched random very big ones and it worked every time and i think its clean above a big enough number. We know of course why this matters because we have Lagrange's theorem that says every number can be written as sum of 4 squares and the Waring problem relates to it. Going 2345 is far more impressive in difficulty and interesting if it has only a finite number of exceptions. Rerunning after many years programs with faster cpus now to check better as we speak so that the above is more accurate lol.
Last edited by masque de Z; 07-19-2020 at 02:38 AM.