Python implementation of the Chinese Remainder algorithm
Project description
ModInt
Python implementation of the Chinese Remainder algorithm
Free software: MIT license
Documentation: https://modint.readthedocs.io.
Features
A usable implementation of the Chinese Remainder algorithm (see https://en.wikipedia.org/wiki/Chinese_remainder_theorem ) under the permissive MIT/Expat licence. Written because none other similarly-licensed ones could be found.
Credits
This package was created with Cookiecutter and the audreyr/cookiecutter-pypackage project template.
History
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.
Source Distribution
modint-0.2.0.tar.gz
(12.9 kB
view details)
File details
Details for the file modint-0.2.0.tar.gz
.
File metadata
- Download URL: modint-0.2.0.tar.gz
- Upload date:
- Size: 12.9 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 3a9f046086c4d9294b86232579d50a3e0fcc9f48c106c30d596b337ee0fb802a |
|
MD5 | 4188785a2fd1bc6a0889481e6b6723c9 |
|
BLAKE2b-256 | 867b7c8148c1121f2cd2ec27ca5d50c3e9be934f5c1426601e9d96569b1d4985 |