arithmoi: Efficient basic number-theoretic functions.

[ algorithms, library, math, mit, number-theory ] [ Propose Tags ]

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

Versions [RSS] [faq],,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, (info)
Change log
Dependencies array (==0.5.*), base (>=4.10 && <5), chimera (>=0.3), constraints, containers (>=0.5.8 && <0.7), deepseq, exact-pi (>=0.5), integer-gmp (<1.2), integer-logarithms (>=1.0), integer-roots (>=1.0), mod, random (>=1.0 && <1.3), semirings (>=0.5.2), transformers (>=0.4 && <0.7), vector (>=0.12) [details]
License MIT
Copyright (c) 2016-2021 Andrew Lelechenko, 2016-2019 Carter Schonwald, 2011 Daniel Fischer
Author Andrew Lelechenko, Daniel Fischer
Maintainer Andrew Lelechenko <>
Category Math, Algorithms, Number Theory
Home page
Bug tracker
Source repo head: git clone
Uploaded by Bodigrim at 2021-09-06T20:30:30Z
Distributions Arch:, LTSHaskell:, NixOS:, Stackage:
Downloads 36555 total (225 in the last 30 days)
Rating 2.0 (votes: 4) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2021-09-06 [all 1 reports]


[Index] [Quick Jump]


Maintainer's Corner

For package maintainers and hackage trustees