Hi
I've added a project idea here: *Number Theory* *Idea* I want to Implement more functions in number theory Finding solutions to system Diophantine equations, Prime factorization of factorials in less time, Finding n consecutive composite numbers , Checking Perfect Number or not, Whether Given number is Perfect Nth power or not Finding Solutions for a2 + b2 = c2 for a given c Given two numbers like ax , by finding which one is larger without computing exact values *Status* I found methods to solve diophantine equations but not found for system of diphantine equations Prime factorization was implemeted for normal methods we can apply same for factorials but it will be more time taking process Finding n consecutive composite numbers are not implemented Perfect Number Not Implemented *Potential Mentors* *Involved Software* Sympy *Difficulty* Intermediate *Prerequisite Knowledge* Number Theory I am familiar with topics Diophantine equation,Congruence ,Continued Fraction,Divisor Function,Euclidean Algorithm,Fermat's Last Theorem,Perfect Number,Prime Factorization Algorithms, Totient Function. -- 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 sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. 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/af408d62-edc7-496d-90d8-a7c209e37c3b%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
