arithmoi

Efficient basic number-theoretic functions.

Version on this page:	0.6.0.1@rev:3
LTS Haskell 23.19:	0.13.1.0
Stackage Nightly 2025-04-24:	0.13.1.0
Latest on Hackage:	0.13.1.0

See all snapshots arithmoi appears in

MIT licensed by Daniel Fischer

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.6.0.1@sha256:38392aad7831c7e93ee69a4bbc4afa34893ac54127eb71557b26a97e4f5808aa,8427

Module documentation for 0.6.0.1

GHC
- GHC.TypeNats
  - GHC.TypeNats.Compat
Math
- Math.NumberTheory
  - Math.NumberTheory.ArithmeticFunctions
    - Math.NumberTheory.ArithmeticFunctions.Class
    - Math.NumberTheory.ArithmeticFunctions.Standard
  - Math.NumberTheory.Curves
    - Math.NumberTheory.Curves.Montgomery
  - 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.Primes
  - Math.NumberTheory.Recurrencies
    - Math.NumberTheory.Recurrencies.Bilinear
    - Math.NumberTheory.Recurrencies.Linear
  - Math.NumberTheory.UniqueFactorisation
  - Math.NumberTheory.Zeta

Depends on 9 packages(full list with versions):

array, base, containers, exact-pi, ghc-prim, integer-gmp, integer-logarithms, mtl, random

Used by 1 package in lts-11.22(full list with versions):

pell

A library of basic functionality needed for number-theoretic calculations. The aim of this library is to provide efficient implementations of the functions. Primes and related things (totients, factorisation), powers (integer roots and tests, modular exponentiation).