arithmoi

Efficient basic number-theoretic functions.

Version on this page:	0.10.0.0@rev:1
LTS Haskell 23.0:	0.13.0.0@rev:4
Stackage Nightly 2024-12-09:	0.13.0.0@rev:4
Latest on Hackage:	0.13.0.0@rev:4

See all snapshots arithmoi appears in

MIT licensed by Andrew Lelechenko, Daniel Fischer

Maintained by Andrew Lelechenko andrew dot lelechenko at gmail dot com, Carter Schonwald carter at wellposed dot com

This version can be pinned in stack with:arithmoi-0.10.0.0@sha256:1fbdf62d5b72196de1d4da393a892218d089714ec691e75ec54f3b2d529c896e,7988

Module documentation for 0.10.0.0

GHC
- GHC.TypeNats
  - GHC.TypeNats.Compat
Math
- Math.NumberTheory
  - Math.NumberTheory.ArithmeticFunctions
  - Math.NumberTheory.Curves
    - Math.NumberTheory.Curves.Montgomery
  - Math.NumberTheory.Euclidean
    - Math.NumberTheory.Euclidean.Coprimes
  - 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.Modular
    - Math.NumberTheory.Powers.Squares
      - Math.NumberTheory.Powers.Squares.Internal
  - Math.NumberTheory.Prefactored
  - Math.NumberTheory.Primes
  - Math.NumberTheory.Quadratic
    - Math.NumberTheory.Quadratic.EisensteinIntegers
    - Math.NumberTheory.Quadratic.GaussianIntegers
  - Math.NumberTheory.Recurrences
    - Math.NumberTheory.Recurrences.Bilinear
    - Math.NumberTheory.Recurrences.Linear
  - Math.NumberTheory.SmoothNumbers
  - Math.NumberTheory.Zeta
    - Math.NumberTheory.Zeta.Dirichlet
    - Math.NumberTheory.Zeta.Hurwitz
    - Math.NumberTheory.Zeta.Riemann

Depends on 15 packages(full list with versions):

arithmoi, array, base, constraints, containers, deepseq, exact-pi, ghc-prim, hmatrix-gsl, integer-gmp, integer-logarithms, random, semirings, transformers, vector

Used by 3 packages in lts-16.31(full list with versions):

arithmoi, cyclotomic, quadratic-irrational

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).