Euler's sum of powers conjecture: Difference between revisions
m
pow table has upper bound of 249
m (pow table has upper bound of 249) |
|||
Line 745:
LET solve() BE {
LET pow5 = VEC
LET sum = ?
FOR i = 1 TO
pow5!i := i * i * i * i * i
| |||