CS 495 Special Topics in CS: Evolutionary Computation Fall 2002, Instructor: Jeffrey Horn
Description:
Definition of Generalized Problem: x0n + x1n + x2n + . . . +xk-1n = xkn Find integers x0, x1, ... , xk and n (with all > 1) that satisfy the equation above. Famous results:
- For k = 2, n = 2 this is Pythagorem's theorem, with many known solutions (e.g., x0 = 3, x1 = 4, x2 = 5)
- For k = 2, n > 2 this is Fermat's Last Conjecture, which Andrew Wiles recently proved to be a theorem, namely that there IS NO SOLUTION: x0n + x1n ¬= x2n for n > 2 .
But what about other values of k and n?
Related Sites:
- On a Generalized Fermat-Wiles Equation
- Mark Dettinger's Conjecture
- Computing Minimal Equal Sums Of Like Powers (a related but direction to go in!)
The Table: (summarizing MY current state of knowledge for this problem)
| k \ n | n = 2 | n = 3 | n = 4 | n = 5 | n = 6 | n = 7 . . . |
| k = 2
(Fermat) |
32 + 42 = 52 etc. (Pythagorem, B.C.) |
No solution!
(Wiles, 1993) |
No solution!
(Wiles, 1993) |
No solution!
(Wiles, 1993) |
No solution!
(Wiles, 1993) |
No solution!
(Wiles, 1993) |
| k = 3 | 2^2 + 3^2 + 6^2 = 7^2
Karl Haendler |
33 +
43 + 53 = 63
(classic result) |
958004
+ 2175194 + 4145604 = 4224814
(Norrie, 1911) |
Paul Cornwell | ||
| k = 4 | 2^2 + 4^2 + 5^2 + 6^2 = 9^2
Karl Haendler |
36^3 + 3^3 + 15^3 + 21^3 = 39^3
Derrick Cearfoss |
304
+ 1204 + 2724 + 3154 = 3534
(Elkies and Frye, 1988) |
275
+ 845 + 1105 + 1335 = 1445
(Lander and Parkin, 1966) |
Nicola Makela | |
| k = 5 | 2^2 + 4^2 + 6^2 + 7^2 + 8^2 = 13^2
Karl Haendler |
13 + 13 + 23 + 33 + 33 = 43 | 12^4 + 24^4 + 42^4 + 18^4 + 27^4 = 45^4 | 67^5 + 19^5 +
43^5 + 46^5 + 47^5 = 72^5
(Ryan Hallstrom) |
||
| k = 6 | 2^2 + 4^2 + 5^2 + 6^2 + 8^2 + 12^2 = 17^2
Karl Haendler |
1^4 + 2^4 + 2^4 + 2^4 + 2^4 + 2^4 = 81 = 3^4 | 13^5 + 18^5 +
23^5 + 36^5 + 66^5 + 31^5 = 1350125107 = 67^5
(Ryan Hallstrom) |
known open | ||
| k = 7
. . . |
2^2 + 4^2 + 5^2 + 6^2 + 8^2 + 10^2 + 14^2 = 21^2
Karl Haendler |
34^4 + 8^4 + 50^4 + 1^4 + 4^4 + 22^4 + 16^4 = 53^4 | Chaplin Cinelli | known open |
Tasks: