Timeline for Combinatorics Problem: $\sum _{k=0}^{s-1} \binom{n}{k}=\sum _{k=1}^s 2^{k-1} \binom{n-k}{s-k}$
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2014 at 13:49 | vote | accept | CommunityBot | ||
| Jun 30, 2014 at 13:49 | |||||
| Jun 30, 2014 at 13:49 | vote | accept | CommunityBot | ||
| Jun 30, 2014 at 13:49 | |||||
| Jun 28, 2014 at 20:08 | comment | added | Todd Trimble | @JeremyRickard lol... I use OP interchangeably for "Original Poster" and "Original Post". Nice bijective proof by the way (although it took me probably about as long puzzling through it as my remark took you). | |
| Jun 28, 2014 at 19:57 | comment | added | Jeremy Rickard | I spent a puzzled couple of minutes wondering what was so cute about who the OP is, until I realized that's not what you meant by his/her identity ... | |
| Jun 28, 2014 at 16:14 | history | answered | Todd Trimble | CC BY-SA 3.0 |