Counterexample to Euler's conjecture on sums of like powers
fermatslibrary.com
Counterexample to Euler's conjecture on sums of like powers
1–10 of 41 posts
Re: Counterexample to Euler's conjecture on sums of like powers
#2(Also a nice early-ish use of supercomputers to solve pure math problems).
Re: Counterexample to Euler's conjecture on sums of like powers
#3Re: Counterexample to Euler's conjecture on sums of like powers
#4I only wish they'd described the method they used to find the counterexample.
Re: Counterexample to Euler's conjecture on sums of like powers
#527^5 + 34^5 + 110^5 + 133^5 = 144^5
Re: Counterexample to Euler's conjecture on sums of like powers
#6Edit: I guess the answer might be "5" depending on what the paper means by "smallest" example. (smallest largest number vs smallest smallest number.)
Re: Counterexample to Euler's conjecture on sums of like powers
#7Re: Counterexample to Euler's conjecture on sums of like powers
#8Is it known what the smallest power is for which three summands are insufficient? Is there a smallest power? I imagine that would be hugely difficult, but for all I know it falls to the same methods as Fermat. (I'm no expert.) Edit: I guess the answer might be "5" depending on what the paper means by "smallest" example. (smallest largest number vs smallest smallest number.)
Re: Counterexample to Euler's conjecture on sums of like powers
#9434437^15 + 588129^15 = 588544^15
https://www.google.com/search?q=588129%5E15+%2B+434437%5E15+...
Re: Counterexample to Euler's conjecture on sums of like powers
#10The recent counterexample to Fermat's Last Theorem was pretty interesting, too. 434437^15 + 588129^15 = 588544^15 https://www.google.com/search?q=588129%5E15+%2B+434437%5E15+...
434437¹⁵ + 588129¹⁵ = 352114612798389918432959038931874707477944791745072116429171623348641601872653349744942
588544¹⁵ = 352114612798389919037509191076162751408804961099244071160111294752887772695040228327424
It’s apparently close enough to fool Google, but it’s not correct.