-
Notifications
You must be signed in to change notification settings - Fork 7
GregOwen/Chinese-Remainder-Theorem
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
This program solves the multiple congruences given by the integer arrays constraints and mods. It returns a single congruence via the Chinese Remainder Theorem.
About
Solves a given set of modular constraints in which the moduli are all mutually prime.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published