[sympy] simplifying combinatorial sum

Given natural numbers n, r, 0<=r<=n, I'm dealing with the expression I have the strong suspicion that this can be simplified to a product of binomial coefficients. Is

Re: [sympy] simplifying combinatorial sum

You can try using combsimp(). I think it has also received some improvements in master. You can also try using SymPy to evaluate the sum. Aaron Meurer On Thu, Nov 23, 2017 at 2:43 AM, Nico Schlömer wrote: > Given natural numbers n, r, 0<=r<=n, I'm dealing with the expression > > >

[sympy] Request for comment: new changelog process

There have been many discussions for some time about the poor quality of our changelogs. Basically, the issue is that almost no one updates the release notes (currently on the wiki https://github.com/sympy/sympy/wiki/Release-Notes) when a PR is merged, so it is generally left to me to do at release