Anonymous user
First perfect square in base n with n unique digits: Difference between revisions
First perfect square in base n with n unique digits (view source)
Revision as of 18:20, 20 May 2020
, 4 years ago→{{header|Haskell}}
No edit summary |
|||
Line 807:
b = unfoldr (\(v, n) -> Just (v, (v + n, n + 2))) (i ^ 2, i * 2 + 1)
where
i = succ
searchSequence :: Integral a => a -> Maybe a
Line 816:
display :: Integer -> Integer -> String
display b
main :: IO ()
Line 846:
Base 15: 1012b857² -> 102597bace836d4
Base 16: 404a9d9b² -> 1025648cfea37bd9</pre>
=={{header|J}}==
<lang>
| |||