Numeric.NumberTheory

This module provides fast number theoretic functions when possible.

Documentation

totient :: Int -> Int

Euler totient function.

tau :: Int -> Int

Number of distinct divisors.

littleOmega :: Int -> Int

isPerfect :: Int -> Bool

See here

sumDivisors :: Int -> Int

Sum of proper divisors.

jacobi

Arguments

:: Int

a

-> Int

n

-> Int

The Jacobi symbol (a/n) (see here) for more.

This function is somewhat experimental, and future improvements to performance are expected.