fast-arithmetic-0.6.7.0: Fast functions on integers.
CopyrightCopyright (c) 2018 Vanessa McHale
Safe HaskellNone
LanguageHaskell2010

Numeric.NumberTheory

Description

This module provides fast number theoretic functions.

Synopsis

Documentation

totient :: Int -> Int Source #

Euler totient function.

tau :: Int -> Int Source #

Number of distinct divisors.

littleOmega :: Int -> Int Source #

Number of distinct prime factors

isPerfect :: Int -> Bool Source #

See here

sumDivisors :: Int -> Int Source #

Sum of proper divisors. May overflow.

isPrime :: Int -> Bool Source #

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

radical :: Int -> Int Source #

Radical of an integer

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

isSemiprime :: Int -> Bool Source #

Since: 0.6.5.0