Numeric.NumberTheory

This module provides fast number theoretic functions.

Documentation

totient :: Int -> Int

Euler totient function.

tau :: Int -> Int

Number of distinct divisors.

littleOmega :: Int -> Int

Number of distinct prime factors

isPerfect :: Int -> Bool

See here

sumDivisors :: Int -> Int

Sum of proper divisors. May overflow.

isPrime :: Int -> Bool

\( O(\sqrt(n)) \)

radical :: Int -> Int

Radical of an integer

\( \text{rad}(n) = \displaystyle\prod_{p | n} p \)

isSemiprime :: Int -> Bool

Since: 0.6.5.0