Timeline for How to calculate the sum of general type $\sum_{k=0}^n {n\choose k} {n\choose k+a} {2 k- n + a \choose r }$?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7, 2022 at 9:54 | comment | added | Sergii Voloshyn | Aha . Very nice. Thank you. | |
| Aug 7, 2022 at 6:27 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 595 characters in body
|
| Aug 7, 2022 at 4:27 | comment | added | Fedor Petrov | I added more details | |
| Aug 7, 2022 at 4:26 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 87 characters in body
|
| Aug 6, 2022 at 20:40 | comment | added | Sergii Voloshyn | OK. How can the last expression be useful? My sum includes rather 3 binomials than 2. | |
| Aug 6, 2022 at 16:20 | comment | added | Fedor Petrov | I mean a usual algorithm of expanding the polynomial in binomial basis, like Newton inrerpolation. Possibly there are more clever ways to find these $c_i$ and then to simplify the answer | |
| Aug 6, 2022 at 15:46 | comment | added | Sergii Voloshyn | Thank you. Could you specify this algorithm? | |
| Aug 5, 2022 at 20:08 | history | answered | Fedor Petrov | CC BY-SA 4.0 |