arithmoi

Efficient basic number-theoretic functions. Primes, powers, integer logarithms.

Version on this page:	0.4.1.1@rev:2
LTS Haskell 22.39:	0.13.0.0@rev:4
Stackage Nightly 2024-10-29:	0.13.0.0@rev:4
Latest on Hackage:	0.13.0.0@rev:4

See all snapshots arithmoi appears in

MIT licensed by Daniel Fischer

Maintained by Daniel Fischer

This version can be pinned in stack with:arithmoi-0.4.1.1@sha256:8bf01e402d887e4d95dad0189e75420b125c15bc6234784929535a08c471298a,4205

Module documentation for 0.4.1.1

Math
- Math.NumberTheory
  - Math.NumberTheory.GCD
    - Math.NumberTheory.GCD.LowLevel
  - Math.NumberTheory.Logarithms
  - Math.NumberTheory.Lucas
  - 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.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

Depends on 7 packages(full list with versions):

array, base, containers, ghc-prim, integer-gmp, mtl, random

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

diagrams-contrib

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), integer logarithms. Note: Requires GHC >= 6.12 with the integer-gmp package for efficiency. Portability is on the to-do list (with low priority, however).