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

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

Versions [faq] 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.2.0.4, 0.2.0.5, 0.2.0.6, 0.3.0.0, 0.4.0.0, 0.4.0.1, 0.4.0.2, 0.4.0.3, 0.4.0.4, 0.4.1.0, 0.4.1.1, 0.4.1.2, 0.4.1.3, 0.4.2.0, 0.4.3.0, 0.5.0.0, 0.5.0.1, 0.6.0.0, 0.6.0.1, 0.7.0.0, 0.8.0.0, 0.9.0.0, 0.10.0.0, 0.11.0.0 (info) Changes array (>=0.3 && <0.5), base (==4.*), containers (>=0.3 && <0.5), ghc-prim, integer-gmp, mtl (==2.0.*), random (==1.0.*) [details] MIT (c) 2011 Daniel Fischer Daniel Fischer Daniel Fischer Math, Algorithms, Number Theory https://bitbucket.org/dafis/arithmoi https://bitbucket.org/dafis/arithmoi/issues head: hg clone https://bitbucket.org/dafis/arithmoi by DanielFischer at 2012-05-19T16:42:15Z LTSHaskell:0.8.0.0, NixOS:0.11.0.0, Stackage:0.9.0.0 31914 total (703 in the last 30 days) 2.0 (votes: 4) [estimated by Bayesian average] λ λ λ Docs uploaded by userBuild status unknown