AntiPrimes

a.k.a. highliy composite numbers

Documentation

type Nui = Int

Number under investigation

type Siz = Int

number of divisors of Nui

type Lst = [(Nui, Siz)]

list of tuples: numbers and their divisor sizes

size :: Nui -> Siz

calculate the "size" of all possible factors of a number

>>> import qualified AntiPrimes as AP
>>> AP.size 12
6                -- as [1,2,3,4,6,12] are possible

dividers :: Nui -> [Int]

calculate all possible dividers of a number

>>> import qualified AntiPrimes as AP
>>> AP.dividers 12
[1,2,3,4,6,12]

proof :: Nui -> Bool

proof if a number is an antiprime

>>> import qualified AntiPrimes as AP
>>> AP.proof 4
True
>>> AP.proof 5
False

list :: Int -> Lst

show all (antiprimes, size) below a number

>>> import qualified AntiPrimes as AP
>>> AP.list 12
[(1,1),(2,2),(4,3),(6,4)]