Jump to content

Sequence: nth number with exactly n divisors: Difference between revisions

m
Line 405:
=={{header|Haskell}}==
<lang haskell>import Control.Monad (guard)
import Data.List (find, unfoldr)
import Math.NumberTheory.ArithmeticFunctions (divisorCount)
import Math.NumberTheory.Primes (Prime, nextPrime,unPrime)
unPrime)
import Math.NumberTheory.Primes.Testing (isPrime)
 
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.