Solve linear and quadratic diophantine equations in two variables: Ax^2 + Bxy + Cy^2 + Dx + Ey + F = 0
-
Updated
Dec 21, 2022 - Java
Solve linear and quadratic diophantine equations in two variables: Ax^2 + Bxy + Cy^2 + Dx + Ey + F = 0
A set of python programs that can be used by early learners of the Mathematical Foundations of Computer Sciences (courtesy: Introduction to the Theory of Computation by Michael Sipser)
Encryption algorithm based on system of linear diophantine equations resistant to quantum algorithms
iLWN (In Love With Numbers) project repository. Contains source code (all subprojects + website) and documentation.
A Julia solver for the general diophantine taxicab equation using heaps for linear storage usage.
🧮 Solve linear Diophantine equations of the form ax + by = c
A method to find a derivative of a function at x = 0 via its series and a diophantine equation
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
C++ implementation of a solver for linear Diophantine equations
Add a description, image, and links to the diophantine-equation topic page so that developers can more easily learn about it.
To associate your repository with the diophantine-equation topic, visit your repo's landing page and select "manage topics."