Python3 Garner's algorithm to solve diophantine equations system with coprime moduli
-
Updated
Apr 8, 2020 - Python
Python3 Garner's algorithm to solve diophantine equations system with coprime moduli
🔓 Tools to help Discrete Mathematics computations.
Diophantine equation, equation involving only sums, products, and powers in which all the constants are integers and the only solutions of interest are integers. For example, 3x + 7y = 1 or x2 − y2 = z3, where x, y, and z are integers. Solved in Qgis console using user input
Add a description, image, and links to the diophantine-solver topic page so that developers can more easily learn about it.
To associate your repository with the diophantine-solver topic, visit your repo's landing page and select "manage topics."