name: arithmetic version: 1.5 category: Number Theory synopsis: Natural number arithmetic license: MIT license-file: LICENSE cabal-version: >= 1.8.0.2 build-type: Simple author: Joe Leslie-Hurd maintainer: Joe Leslie-Hurd description: This package implements a library of natural number arithmetic functions, including Montgomery multiplication, the Miller-Rabin primality test, Lucas sequences, the Williams p+1 factorization method, continued fraction representations of natural number square roots, the Jacobi symbol, the Tonelli-Shanks algorithm for finding square roots modulo a prime, and the Chakravala method for solving the Pell equation. Library build-depends: base >= 4.0 && < 5.0, random >= 1.0.1.1 && < 2.0, QuickCheck >= 2.4.0.1 && < 3.0, containers >= 0.4.2.1 && < 1.0, opentheory-primitive >= 1.8 && < 2.0, opentheory >= 1.0 && < 2.0, opentheory-bits >= 1.0 && < 2.0, opentheory-divides >= 1.0 && < 2.0 hs-source-dirs: src ghc-options: -Wall exposed-modules: Arithmetic.ContinuedFraction, Arithmetic.Lucas, Arithmetic.Modular, Arithmetic.Montgomery, Arithmetic.Pell, Arithmetic.Polynomial, Arithmetic.Prime, Arithmetic.Prime.Factor, Arithmetic.Prime.Sieve, Arithmetic.Quadratic, Arithmetic.Random, Arithmetic.Ring, Arithmetic.Utility, Arithmetic.Utility.Heap, Arithmetic.Williams executable arithmetic build-depends: base >= 4.0 && < 5.0, random >= 1.0.1.1 && < 2.0, QuickCheck >= 2.4.0.1 && < 3.0, containers >= 0.4.2.1 && < 1.0, opentheory-primitive >= 1.8 && < 2.0, opentheory >= 1.0 && < 2.0, opentheory-bits >= 1.0 && < 2.0, opentheory-divides >= 1.0 && < 2.0 hs-source-dirs: src ghc-options: -Wall main-is: Main.hs test-suite arithmetic-test type: exitcode-stdio-1.0 build-depends: base >= 4.0 && < 5.0, random >= 1.0.1.1 && < 2.0, QuickCheck >= 2.4.0.1 && < 3.0, containers >= 0.4.2.1 && < 1.0, opentheory-primitive >= 1.8 && < 2.0, opentheory >= 1.0 && < 2.0, opentheory-bits >= 1.0 && < 2.0, opentheory-divides >= 1.0 && < 2.0, opentheory-prime >= 1.0 && < 2.0 hs-source-dirs: src ghc-options: -Wall main-is: Test.hs