Skip to main content

Python implementation of the Chinese Remainder algorithm

Project description

ModInt Documentation Status Updates

Python implementation of the Chinese Remainder algorithm


A usable implementation of the Chinese Remainder algorithm (see ) under the permissive MIT/Expat licence. Written because none other similarly-licensed ones could be found.

What this does is given two-or-more pairwise coprime bases integers and their corresponding moduli, it finds an integer that yields these moduli for all the bases.


Here is an example:

from modint import ChineseRemainderConstructor, chinese_remainder

cr = ChineseRemainderConstructor([2, 5])
# Because 5 % 2 == 1 and 5 % 5 == 0
assert cr.rem([1, 0]) == 5
# Because 8 % 2 == 0 and 8 % 5 == 3
assert cr.rem([0, 3]) == 8

# Convenience function
assert chinese_remainder([2, 3, 7], [1, 2, 3]) == 17


This package was created with Cookiecutter and the audreyr/cookiecutter-pypackage project template.


0.2.1 (2018-05-02)

  • Fix tests.

0.2.0 (2017-12-09)

  • Better documentation with synopses and examples.
  • Add Travis-CI.

0.1.0 (2017-03-16)

  • First release on PyPI.

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for modint, version 0.2.1
Filename, size File type Python version Upload date Hashes
Filename, size modint-0.2.1.tar.gz (13.5 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page