Revision as of 11:23, 10 December 2020 view source Hout (talk \| contribs) 9,665 edits m →‎{{header\|Haskell}} ← Older edit		Revision as of 23:07, 14 December 2020 view source Alextretyak (talk \| contribs) 1,481 edits m →‎{{header\|11l}} Newer edit →
Line 31: <lang 11l>F eulers_sum_of_powers() V max_n = 250 V pow_5 = (0 .< max_n).map(n -> Int64(n) ^ 5)) V pow5_to_n = Dict(0 .< max_n, n -> (Int64(n) ^ 5), n)) L(x0) 1 .< max_n

Euler's sum of powers conjecture: Difference between revisions