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. -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/a1e9cb79-afa9-4738-aeb7-a6073d214df6%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
