Timeline for A finite alternating sum
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 31, 2019 at 22:48 | comment | added | jamesh625 | "The art of computer programming" by Knuth, most likely. | |
| Oct 30, 2019 at 5:29 | vote | accept | Francisco | ||
| Oct 30, 2019 at 5:28 | vote | accept | Francisco | ||
| Oct 30, 2019 at 5:29 | |||||
| Oct 30, 2019 at 5:28 | vote | accept | Francisco | ||
| Oct 30, 2019 at 5:28 | |||||
| Oct 28, 2019 at 7:02 | answer | added | Fedor Petrov | timeline score: 18 | |
| Oct 28, 2019 at 6:35 | history | became hot network question | |||
| Oct 28, 2019 at 4:30 | comment | added | Gerry Myerson | @Henri, "The Art of Knuth"? | |
| Oct 27, 2019 at 23:59 | answer | added | WhatsUp | timeline score: 23 | |
| Oct 27, 2019 at 23:19 | comment | added | Henri Cohen | Section 1.2.11.3 of volume 1 of The Art of Knuth contains very similar sums, and the techniques there should give you your answer $(2n+2/3+o(1))e^{-n}$, but I haven't worked out the details. | |
| Oct 27, 2019 at 22:49 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title
|
| Oct 27, 2019 at 22:30 | review | First posts | |||
| Oct 27, 2019 at 22:41 | |||||
| Oct 27, 2019 at 22:29 | history | asked | Francisco | CC BY-SA 4.0 |