fast-combinatorics-0.1.0.9: Fast combinatorics.

Numeric.NumberTheory

Description

Synopsis

totient :: Int -> Int Source #

Euler totient function.

tau :: Int -> Int Source #

Number of distinct prime divisors.

totientSum :: Int -> Int Source #

[totient k | k <- [1 .. n]] in Haskell

[totient k | k <- [1 .. n]]