modular-arithmetic: A type for integers modulo some constant.

[ bsd3, library, math ] [ Propose Tags ]

A convenient type for working with integers modulo some constant. It saves you from manually wrapping numeric operations all over the place and prevents a range of simple mistakes. Integer Mod 7 is the type of integers (mod 7) backed by Integer. We also have some cute syntax for these types like ℤ/7 for integers modulo 7.


[Skip to Readme]
Versions [faq] 1.0.0.0, 1.0.0.1, 1.0.1.0, 1.0.1.1, 1.1.0.0, 1.2.0.0, 1.2.1.0, 1.2.1.1, 1.2.1.2, 1.2.1.3, 1.2.1.4, 1.2.1.5
Change log CHANGELOG.md
Dependencies base (<5) [details]
License BSD-3-Clause
Author Tikhon Jelvis <tikhon@jelv.is>
Maintainer Tikhon Jelvis <tikhon@jelv.is>
Category Math
Home page https://github.com/TikhonJelvis/modular-arithmetic
Bug tracker https://github.com/TikhonJelvis/modular-arithmetic/issues
Source repo head: git clone git://github.com/TikhonJelvis/modular-arithmetic.git
Uploaded by TikhonJelvis at Wed Feb 6 18:30:32 UTC 2019
Distributions NixOS:1.2.1.4
Downloads 3748 total (261 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-02-06 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for modular-arithmetic-1.2.1.5

[back to package description]

Modular Arithmetic

Hackage package Build Status

This package provides a type for integers modulo some constant, usually written as ℤ/n.

Here is a quick example:

>>> 10 * 11 :: ℤ/7
5

It also works correctly with negative numeric literals:

>>> (-10) * 11 :: ℤ/7
2

Modular division is an inverse of modular multiplication. It is defined when divisor is coprime to modulus:

>>> 7 `div` 3 :: ℤ/16
13
>>> 3 * 13 :: ℤ/16
7