[sympy] Re: Gsoc 2020 : Implementing better integer factorization algorithms

2020-03-30 Thread ABHINAV ANAND
I have submitted my proposal, but since the deadline is tomorrow and google allows edition the proposal, so i humbly request the mentors to please review my proposal and if there are any improvements that might be needed please let me know.

[sympy] Re: Gsoc 2020 : Implementing better integer factorization algorithms

2020-03-08 Thread ABHINAV ANAND
I have started making my proposal for the GSOC. This is the link https://docs.google.com/document/d/1y_kLou7NwodV75puX88Lihdkx63sw5aQEc1zVuh8_NM/edit?usp=sharing Please review my proposal and suggest any improvements. -- You received this message because you are subscribed to the Google Groups

[sympy] Re: Gsoc 2020 : Implementing better integer factorization algorithms

2020-02-25 Thread Kalevi Suominen
Hi, I think that it is enough work for a summer of code (maybe even more than enough). It would be a good addition to the prime testing and factorization modules of SymPy. Kalevi Suominen On Tuesday, February 25, 2020 at 10:02:07 PM UTC+2, ABHINAV ANAND wrote: > > Hey, i hope the work done on

[sympy] Re: Gsoc 2020 : Implementing better integer factorization algorithms

2020-02-25 Thread ABHINAV ANAND
Hey, i hope the work done on the referenced pr is good. I wanted to confirm that the idea that i gave can be part of Gsoc this year. I mean if it is enough work for the summer and withn the scope of sympy. If yes then i will start making a formal proposal and improve it based on your opinions,

[sympy] Re: Gsoc 2020 : Implementing better integer factorization algorithms

2020-02-16 Thread Kalevi Suominen
Hi, Yes, those algorithms are relevant to SymPy. For the first one, you might be interested in completing this PR: https://github.com/sympy/sympy/pull/2449. It should be possible to make it work also with finite fields and rings. Kalevi Suominen On Sunday, February 16, 2020 at 7:52:26 PM