Hello. Is there will to implement routines that give closed forms for sums of particular functions over integers?
For example, how to find `sum(p(k) for k in range(n))` where `p(k)` is some polynomial with real coefficients? There is an algorithm in `O((deg p)^2)` which returns a polynomial `P(n)`, whose value at `n` is the desired sum. Algorithm is based on discrete analogue to integral calculus. More information can be found in [1]. What do you think? [1] Graham, Ronald Lewis, 1935- Concrete mathematics : a foundation for computer science Ronald L. Graham, Donald E. Knuth, Oren Patashnik. xiii,625 p. 24 cm. Bibliography: p. 578 Includes index. ISBN o-201-14236-8 -- 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/9bcd6ae1-5ae6-47f4-a5c0-beb713817c49%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
