Timeline for How to calculate: $\sum\limits_{k=0}^{n-m} \frac{1}{n-k} {n-m \choose k}$
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2019 at 4:02 | comment | added | user64494 | @Brendan McKay: Thank you for your valuable comment. | |
| Apr 14, 2019 at 2:21 | comment | added | Brendan McKay | Those factorials of negative integers in the Maple answer are a problem. Doing it slightly differently gives $(-1)^{n+m} \operatorname{JacobiP}(n-m,-n,-n+m-1,3)(n-m)!\,(m-1)!/n!$. | |
| Apr 13, 2019 at 18:13 | history | edited | user64494 | CC BY-SA 4.0 |
added 218 characters in body
|
| Apr 13, 2019 at 18:05 | history | answered | user64494 | CC BY-SA 4.0 |