Timeline for Sum over Binomials and Gammas
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 2, 2017 at 13:09 | history | edited | Coolwater | CC BY-SA 3.0 |
added 6 characters in body
|
| Apr 2, 2015 at 3:43 | vote | accept | bbgodfrey | ||
| Apr 1, 2015 at 16:12 | history | edited | Coolwater | CC BY-SA 3.0 |
added 621 characters in body
|
| Apr 1, 2015 at 12:29 | comment | added | bbgodfrey |
This looks to be the correct solution. Please elaborate on how you went from gg4k1 to your expression for gg4. Thanks.
|
|
| Apr 1, 2015 at 6:17 | comment | added | Sjoerd C. de Vries | I mean, gg4k1[q] is defined using q from 2..11. For q larger than that it is not guaranteed to be the same as gg4[q,1], is it? | |
| Apr 1, 2015 at 6:03 | comment | added | Coolwater | @SjoerdC.deVries The simplified function is actually wrong when k<0. For q<0 it should just be 0, so thats not hard to modify | |
| Apr 1, 2015 at 5:56 | history | edited | Coolwater | CC BY-SA 3.0 |
added 228 characters in body
|
| Apr 1, 2015 at 5:53 | comment | added | Sjoerd C. de Vries | I guess using FindSequenceFunction won't guarantee a correct solution outside of the range of inputs, right? | |
| Apr 1, 2015 at 5:38 | history | answered | Coolwater | CC BY-SA 3.0 |