Timeline for Asymptotic bounds on geometric sums
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| Dec 29, 2016 at 21:35 | answer | added | Algorithms with Attitude | timeline score: 1 | |
| Dec 28, 2016 at 23:26 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 29, 2016 at 21:11 | history | tweeted | twitter.com/StackCompSci/status/803708014951698432 | ||
| Nov 28, 2016 at 22:39 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 29, 2016 at 22:26 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 29, 2016 at 22:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 30, 2016 at 20:48 | answer | added | Yuval Filmus | timeline score: 1 | |
| Aug 30, 2016 at 20:13 | comment | added | Rick Decker | Do you know the formula for a geometric series? That should completely answer your question. | |
| Aug 30, 2016 at 18:29 | comment | added | Raphael | 1) Check a formulary of your choosing for closed forms of this sum. 2) Apply the usual machinery. -- that doesn't sound all too arcane to me, so I have to wonder where you are coming from, and what specifically your problem is. | |
| Aug 30, 2016 at 18:27 | history | edited | Raphael | CC BY-SA 3.0 |
added 10 characters in body; edited tags
|
| Aug 30, 2016 at 18:19 | review | First posts | |||
| Aug 30, 2016 at 20:13 | |||||
| Aug 30, 2016 at 18:19 | history | asked | student201 | CC BY-SA 3.0 |