Message Boards Message Boards

GROUPS:

Sum of binomials

Posted 9 years ago
3656 Views
|
6 Replies
|
0 Total Likes
|

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

POSTED BY: d m
6 Replies

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 BY: S M Blinder
Posted 9 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 BY: d m
Posted 9 years ago

I think you'd get more help if the sums were translated to Wolfram Language as suggested by the Moderation Team.

POSTED BY: Jim Baldwin

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.

http://reference.wolfram.com/language/ref/Sum.html
http://reference.wolfram.com/language/ref/Binomial.html
http://reference.wolfram.com/language/tutorial/SomeGeneralNotationsAndConventions.html

POSTED BY: Moderation Team
Posted 9 years ago

Thank you for the hint!

POSTED BY: d m
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract