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.
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.1.0.tar.gz
(12.9 kB
view details)
File details
Details for the file modint-0.1.0.tar.gz.
File metadata
- Download URL: modint-0.1.0.tar.gz
- Upload date:
- Size: 12.9 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 117a3e75b9be8a60e8c5bce2b2b535f9db5ce8ed6bf491679ef840ea6e239c25 |
|
| MD5 | 88fdbca8625fd5526ac36e051f905ace |
|
| BLAKE2b-256 | 30f57aa5652ee54a8852b6323295943778eba297ff654b5aaec90ce21699d88d |
