Timeline for Simplest form for sum of Binomial Expressions
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2014 at 18:41 | history | edited | The Masked Avenger | CC BY-SA 3.0 |
added 917 characters in body
|
| Nov 23, 2014 at 22:30 | comment | added | Phylliida | Though this answer would be a good algorithm for solving the first problem as well in a similar fashion, if s and r were constants, you're right. | |
| Nov 23, 2014 at 22:28 | comment | added | Phylliida | Unless I am misunderstanding what this algorithm does, I believe it has the same problem as your comment earlier: the relation must hold for all s and r > all the constants, not just for fixed values of s and r. If this wasn't the case, the problem would be trivial - simply compute the total T of the n terms, call this w, and return w choose 1, aka m=1. I assume this is what you meant in your comment (since you can't do _ choose 1 in the first problem but you can in the second), however this method isn't valid for either because s and r aren't constants. | |
| Nov 23, 2014 at 20:36 | comment | added | The Masked Avenger | I assume 2r is less than s in the above. If this is not the case, tweak the algorithm more greedily. | |
| Nov 23, 2014 at 20:30 | history | answered | The Masked Avenger | CC BY-SA 3.0 |