Hi, I am Sidhant Nagpal, a second year undergraduate student pursuing a degree in Computer Engineering at Netaji Subhas Institute of Technology, India. I will be a GSoC applicant this year. I would like to propose an idea for SymPy - "Numerical Evaluation of Linear Homogeneous Recurrences with constant coefficients" that I wish to work on. As it is difficult to obtain closed form expressions of these type of recurrences for higher order (k), support can be added to evaluate them for arbitrary values of n (possibly in a field).
For example: consider recurrence of order k=1000, f(n) = f(n-999) + f(n-1000), for large n, with given initial conditions f(i) for i < 999. I would love some feedback for the same. I am relatively new to SymPy, but am familiarising myself with it actively. I have a strong Mathematics and Competitive Programming Background (in C++ and Python). Here is my LinkedIn Profile <https://www.linkedin.com/in/sidhantnagpal>. Thanks. -- 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/cad5f6fa-c745-4eae-8e35-841e96c62eed%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
