Anonymous user
Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions
Sequence: smallest number greater than previous term with exactly n divisors (view source)
Revision as of 16:23, 16 July 2020
, 3 years ago→{{header|Haskell}}
Line 306:
countDivisors n = foldr f 0 [1..floor (sqrt $ realToFrac n)]
where
f x r | n `mod` x == 0 =
| otherwise = r
go t ((n,c):xs) | c == t = (t,n):go (succ t) xs
| |||