Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Line 308:
divisorCount = length . nub . foldr (\(a, b) r -> a:b:r) [] . divisors
where
divisors n = [ (x, n `div` x)
| x <- [1..ceiling (sqrt $ realToFrac n)]
, n `mod` x == 0]
Retrieved from "https://rosettacode.org/wiki/Sequence:_smallest_number_greater_than_previous_term_with_exactly_n_divisors"