diophantine-solver

Computer Algebra and Symbolic Computation System for Combinatorics and Algebraic Number Theory for JavaScript

[wip] functorial library with classic algorithms for arithmetic

Computational number theory. Pure Python. Zero dependencies. Unreasonably fast.

🧮 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

Program finds a general formula, which gives all integer solutions to a two variable diophantine linear equation

Python3 Garner's algorithm to solve diophantine equations system with coprime moduli

The Universal Theorem of Prime Numbers

Solves diophantine equations of the form Ax² + Bxy + Cy² +Dx + Ey +F = 0

🧮 Solve linear Diophantine equations of the form ax + by = c

The framework of the future

A Julia solver for the general diophantine taxicab equation using heaps for linear storage usage.

KIT WS2018/19 – Solver of systems of linear diophantine equations in Java.

Solves diophantine equations of the form Ax² + Bxy + Cy² +Dx + Ey +F = 0

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