fast-arithmetic-0.1.0.6: Fast number-theoretic functions.

CopyrightCopyright (c) 2017 Vanessa McHale
Safe HaskellNone
LanguageHaskell2010

Numeric.NumberTheory

Description

 

Synopsis

Documentation

totient :: Int -> Int Source #

Euler totient function.

tau :: Int -> Int Source #

Number of distinct prime divisors.

littleOmega :: Int -> Int Source #

isPerfect :: Int -> Bool Source #

See here