Monthly Archives: June, 2013

Quadratic Diophantine equation – I

Quadratic Diophantine equation is an equation of the form Ax**2 + Bxy + Cy**2 + Dx + Ey + F = 0 where A, B, C, D, E, and F are integer constants and x and y being integer variables. Study of this equation has always been an interesting area among number theorists. The famous …

Continue reading

Solving linear Diophantine equation

When the first week of the GSoC comes to an end, I was able to finish implementing solver for the linear Diophantine equations. A linear Diophantine equation is an equation of the form, where and  c are all integers and are integer variables. Case 1: n = 2 If the linear Diophantine equations has only …

Continue reading

Structure of the Diophantine equation module

The structure of the module is going to be essentially the same as SymPy’s ODE module. ODE module and Diophantine equations (DE) module both need to pattern match a given equation to identify which category it falls and carry out solution procedure accordingly. Below is a pseudo-code representation of the rough structure I wish to …

Continue reading