Hey, I was going through the diophantine equation module and I saw there are too many things and methods that are not yet implemented.
Some of them are:
i)Mihaelescu's Theorem
ii) Lifting the exponent Lemma
iii) Negative Pell's equation
iv) Solving diophantine's using rings
v) Modular arithmetic in diophantine equations
vi) Fermat's infinite descent
vii) Divisor's of a^2-2b^2 and a^2+2b^2
and many more.
Do you think that is worthy for gsoc?
Thank you.