Sequence: nth number with exactly n divisors: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 414: | Line 414: | ||
calc n = do |
calc n = do |
||
x <- [1..] |
x <- [1..] |
||
guard (even n || odd n && f x |
guard (even n || odd n && f x == x) |
||
[(x, divisorCount x)] |
[(x, divisorCount x)] |
||
where f n = floor (sqrt $ realToFrac n) |
where f n = floor (sqrt $ realToFrac n) ^ 2 |
||
havingNthDivisors :: Integer -> [(Integer, Integer)] |
havingNthDivisors :: Integer -> [(Integer, Integer)] |
||
| Line 465: | Line 465: | ||
(29,1116713952456127112240969687448211536647543601817400964721) |
(29,1116713952456127112240969687448211536647543601817400964721) |
||
(30,6768)</pre> |
(30,6768)</pre> |
||
=={{header|Java}}== |
=={{header|Java}}== |
||