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:48, 20 May 2020
, 4 years ago→{{header|Haskell}}: Minor rearrangement of one predicate also proves, FWIW, a little faster.
m (→{{header|Haskell}}: Minor rearrangement of one predicate also proves, FWIW, a little faster.) |
|||
Line 813:
searchSequence :: Integral a => a -> Maybe a
searchSequence
b = find (
where
digitsSet = Set.fromList [0 .. pred b]
Line 829:
(display b n)
Nothing -> pure ())
[2 ..
where
squareRootValue = round . sqrt . realToFrac</lang>
| |||