0
|
4425 Views
|
6 Replies
|
0 Total Likes
View groups...
Share

# Sum of binomials

Posted 10 years ago
 Hi everyone. I have a question related to what I've asked a while ago. I would like to define a following sequence: sum_(i=1)^k [ (k binomial i) * (i+1) ] sum(j=1)^k (sum(i=1)^k [ (k binomial i)*(k binomial j) * (i+j+1) ] sum(i=1)^k (sum(j=1)^k (sum_(t=1)^k [ (k binomial i)(k binomial j)(k binomial t) * (i+j+t) ] etc. Could you please help me with the correct algorithm? Many thanks! D
6 Replies
Sort By:
Posted 10 years ago
 I found that inputting this complex expression gives quite a messy output. But you easily get a numerical result by setting k equal to some integer. Perhaps then make use of the results with k = 1, 2, 3 . . .
Posted 10 years ago
 Thanks SM Blinder, in the end of the day I run simulations,so to run them I thought about having a formula as general as possible. But yes, its quite a messy problem, my paper refers to extensions of binomial distributions, and its not the most elegant model:)
Posted 10 years ago
 I think you'd get more help if the sums were translated to Wolfram Language as suggested by the Moderation Team.
Posted 10 years ago
 A helpful exercise would be to translate your pseudocode into Wolfram Language. http://reference.wolfram.com/ and in the "Search Documentation" slot look for Sum and Binomial.
Posted 10 years ago
 (Refers to http://community.wolfram.com/groups/-/m/t/340791 ?)
Posted 10 years ago
 Thank you for the hint!