Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
-
Updated
Oct 4, 2024 - JavaScript
Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
[wip] functorial library with classic algorithms for arithmetic
🧮 Tools to help Discrete Mathematics computations.
Solve linear and quadratic diophantine equations in two variables: Ax^2 + Bxy + Cy^2 + Dx + Ey + F = 0
C# application that lists solutions for sums of three cubes: x³ + y³ + z³ = n
Python3 Garner's algorithm to solve diophantine equations system with coprime moduli
Program finds a general formula, which gives all integer solutions to a two variable diophantine linear equation
Solves diophantine equations of the form Ax² + Bxy + Cy² +Dx + Ey +F = 0
🧮 Solve linear Diophantine equations of the form ax + by = c
A Julia solver for the general diophantine taxicab equation using heaps for linear storage usage.
The framework of the future
Solves diophantine equations of the form Ax² + Bxy + Cy² +Dx + Ey +F = 0
KIT WS2018/19 – Solver of systems of linear diophantine equations in Java.
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-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."