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:31, 20 May 2020
, 4 years ago→{{header|Haskell}}
m (→{{header|Haskell}}: Applicative formulation of `digits` turns out, FWIW, to be a little faster.) |
|||
Line 801:
digits :: Integral a => a -> a -> [a]
digits
b = unfoldr
sequenceForBaseN :: Integral a => a -> [a]
Line 828 ⟶ 829:
(display b n)
Nothing -> pure ())
[2 ..
where
squareRootValue = round . sqrt . realToFrac</lang>
| |||