Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions
Content added Content deleted
| Line 309: | Line 309: | ||
where |
where |
||
divisors n = [(x, n `div` x) |
divisors n = [(x, n `div` x) |
||
| x <- [1..ceiling (sqrt $ realToFrac n)] |
| x <- [1..ceiling (sqrt $ realToFrac n)] |
||
, n `mod` x == 0] |
, n `mod` x == 0] |
||
go t ((n,d):xs) |
go t ((n,d):xs) |
||
| d == t = (d,n) : go (succ t) xs |
| d == t = (d,n) : go (succ t) xs |
||