Euler's sum of powers conjecture: Difference between revisions
m
→{{header|Haskell}}: Tidied.
m (→{{header|Haskell}}: Tidying.) |
m (→{{header|Haskell}}: Tidied.) |
||
Line 1,729:
------------- EULER'S SUM OF POWERS CONJECTURE -----------
counterExample ::
(M.Map Int (Int, Int), M.Map Int Int) -> Maybe (Int, Int)
counterExample (sumMap, powerMap) =
find
(\(p, s) -> M.member (p - s) sumMap)
Line 1,752 ⟶ 1,753:
main = do
let xs = [1 .. 249]
putStrLn $
"Euler's sum of powers conjecture – " <>
maybe
("no counter-example found in the range " <> rangeString xs)
(showExample
(counterExample
showExample ::
(M.Map Int (Int, Int)
showExample (sumMap, powerMap) xs (p, s) =▼
▲showExample sumMap powerMap xs (p, s) =
"a counter-example in range " <> rangeString xs <> ":\n\n" <>
intercalate "^5 + " (show <$> [a, b, c, d]) <>
| |||