many years ago I solved a puzzle from Knuth's TAOCP book for some computer magazine competition; got a check award 
a^5 + b^5 + c^5 + d^5 = e^5
computers ware much slower back then, my optimized C++ program took 10 minutes on $70K HP high-end workstation.
Now a simple JS program can solve this in 1 second, strange world.
My program code solution was first published 20 years after numeric solution was published in the book, without program, apparently.
And just a week ago there was one new solution published...
But now thanks to Google it is easy to find...
//en.wikipedia.org/wiki/Diophantine_equation
The Diophantine equation \(a^5 + b^5 + c^5 + d^5 = e^5\) (or similarly \(a^5+b^5+c^5+d^5+e^5=0\) when rearranged) has been a topic of study in number theory, looking for integer solutions, with searches going back decades.
Recent Discoveries: A fourth known primitive solution was recently found as of March 2026, indicating continued computational interest in finding such integer solutions, for instance in research papers like this one on arXiv.
The fourth known primitive solution to $a^5 + b^5 + c^5 + d^5 = e^5$
Known Primitive Solutions [
1]
To date, only a few primitive solutions for \(a^5 + b^5 + c^5 + d^5 = e^5\) have been verified. According to documentation on
Math Stack Exchange and
arXiv, they include: [
1]
- Lander-Parkin (1966): (27^5 + 84^5 + 110^5 + 133^5 = 144^5).
- Second Solution: (-220^5 + 5027^5 + 6237^5 + 14068^5 = 14132^5).
- Third Solution: (62^5 + 207^5 + 228^5 + 385^5 = 408^5)
- Fourth Solution (Scher & Seidl, 1996): (55^5 + 3183^5 + 28969^5 + 85282^5 = 85359^5).
- Recent Discovery (2023): (1340632^5 + 7191155^5 + 13316225^5 + 19562135^5 = 19568785^5). [1, 2, 3]
These solutions were historically significant because they disproved Euler's Sum of Powers Conjecture, which hypothesized that at least \(n\) \(n^{th}\) powers are required to sum to another \(n^{th}\) power for \(n > 2\).
The equation \(a^5 + b^5 + c^5 + d^5 = e^5\) represents a generalization of Fermat's Last Theorem for fifth powers. Donald Knuth uses this famous Diophantine equation in The Art of Computer Programming to demonstrate algorithms and search techniques for solving complex mathematical problems on a computer. [1, 2, 3]
In the books, this equation serves as a practical testing ground for different computational approaches: [
1]
In Volume 4A: Combinatorial Algorithms, Knuth uses this equation to explore how to optimize brute-force or backtracking searches. Because checking every possible combination of \(a, b, c, d,\) and \(e\) up to a certain limit takes an immense amount of time, he demonstrates how to dramatically prune the search tree. By evaluating constraints and eliminating invalid paths early, the algorithm avoids unnecessary computations.
Understanding Algorithms (Backtracking And Constraints), Part 32: Backtracking. | by the computer science teacher | Medium
CombinatorialSearch-2x2.pdf @princeton
The Art of Computer Programming VOLUME 4A Combinatorial Algorithms Part 1
Racunari: Drajanove Pitalice
Index of /cpc/ACME/LITTERATURE/REVUES/[BOS]BOSNIAN/[BOS][MULTI]RACUNARI(1984-1989)
RACUNARI_56_1989-12.pdf (strana 58, peti stepeni)
Racunari Magazine 1990 02 : Free Download, Borrow, and Streaming : Internet Archive resenje !!
