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


Maintainer's Corner

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, (info)
Change log
Dependencies array (>=0.5 && <0.6), base (>=4.10 && <5), chimera (>=0.3), constraints, containers (>=0.5.8 && <0.7), deepseq, exact-pi (>=0.5), integer-gmp (<1.1), integer-logarithms (>=1.0), integer-roots (>=1.0), mod, random (>=1.0 && <1.2), semirings (>=0.5.2), transformers (>=0.4 && <0.6), vector (>=0.12) [details]
License MIT
Copyright (c) 2016-2020 Andrew Lelechenko, 2016-2019 Carter Schonwald, 2011 Daniel Fischer
Author Andrew Lelechenko, Daniel Fischer
Maintainer Andrew Lelechenko andrew dot lelechenko at gmail dot com, Carter Schonwald carter at wellposed dot com
Category Math, Algorithms, Number Theory
Home page
Bug tracker
Source repo head: git clone
Uploaded by Bodigrim at 2020-04-14T22:38:49Z
Distributions Arch:, LTSHaskell:, NixOS:
Downloads 39152 total (214 in the last 30 days)
Rating 2.0 (votes: 4) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2020-04-15 [all 1 reports]