Sequence: nth number with exactly n divisors: Difference between revisions
Content added Content deleted
| Line 405: | Line 405: | ||
=={{header|Haskell}}== |
=={{header|Haskell}}== |
||
<lang haskell>import Control.Monad (guard) |
<lang haskell>import Control.Monad (guard) |
||
import Data.List (find, unfoldr) |
|||
import Math.NumberTheory.ArithmeticFunctions (divisorCount) |
import Math.NumberTheory.ArithmeticFunctions (divisorCount) |
||
import Math.NumberTheory.Primes (Prime, |
import Math.NumberTheory.Primes (Prime, unPrime) |
||
unPrime) |
|||
import Math.NumberTheory.Primes.Testing (isPrime) |
import Math.NumberTheory.Primes.Testing (isPrime) |
||