arithmoi
Efficient basic number-theoretic functions.
https://github.com/cartazio/arithmoi
Version on this page: | 0.5.0.0 |
LTS Haskell 23.23: | 0.13.1.0@rev:1 |
Stackage Nightly 2025-05-20: | 0.13.1.0@rev:1 |
Latest on Hackage: | 0.13.1.0@rev:1 |
Maintained by Carter Schonwald carter at wellposed dot com,
Andrew Lelechenko andrew dot lelechenko at gmail dot com
This version can be pinned in stack with:
arithmoi-0.5.0.0@sha256:9b3444daf21754aefe98560a89293daae4323eff4019b05df00d6188cc0880d8,7548
Module documentation for 0.5.0.0
- Math
- Math.NumberTheory
- Math.NumberTheory.ArithmeticFunctions
- Math.NumberTheory.ArithmeticFunctions.Class
- Math.NumberTheory.ArithmeticFunctions.Standard
- Math.NumberTheory.GCD
- Math.NumberTheory.GCD.LowLevel
- Math.NumberTheory.GaussianIntegers
- Math.NumberTheory.Moduli
- Math.NumberTheory.MoebiusInversion
- Math.NumberTheory.MoebiusInversion.Int
- Math.NumberTheory.Powers
- Math.NumberTheory.Powers.Cubes
- Math.NumberTheory.Powers.Fourth
- Math.NumberTheory.Powers.General
- Math.NumberTheory.Powers.Integer
- Math.NumberTheory.Powers.Squares
- Math.NumberTheory.Powers.Squares.Internal
- Math.NumberTheory.Primes
- Math.NumberTheory.Primes.Counting
- Math.NumberTheory.Primes.Factorisation
- Math.NumberTheory.Primes.Factorisation.Certified
- Math.NumberTheory.Primes.Heap
- Math.NumberTheory.Primes.Sieve
- Math.NumberTheory.Primes.Testing
- Math.NumberTheory.Primes.Testing.Certificates
- Math.NumberTheory.Recurrencies
- Math.NumberTheory.Recurrencies.Bilinear
- Math.NumberTheory.Recurrencies.Linear
- Math.NumberTheory.UniqueFactorisation
- Math.NumberTheory.Zeta
- Math.NumberTheory.ArithmeticFunctions
- Math.NumberTheory
Depends on 9 packages(full list with versions):