Waste less time on Facebook — follow Brilliant.

Help: Multiple summation problem

Please help in computing the following summation.

\[\large \mathop{\sum\sum\sum\sum}_{0 \leq i < j < k < l\leq n } 2 \]

The answer to this is \(2 \dbinom{ n+1 }{4} \).

Note by Swagat Panda
1 year ago

No vote yet
1 vote


Sort by:

Top Newest

The given sum is just twice the ways of ways of picking integers \(i, j, k, l\) with the constraint that \(0\leq i<j<k<l\leq n\) which is just \[2 {n+1 \choose 4} \] Deeparaj Bhat · 1 year ago

Log in to reply

@Deeparaj Bhat thank you very much Swagat Panda · 1 year ago

Log in to reply

@Swagat Panda In fact, we have,

\[\large\underset{a\leq r_1\lt r_2\lt\cdots\lt r_n\leq b}{\sum\sum\cdots\sum\sum}1=\begin{cases}\begin{align*}\dbinom{b-a+1}{n}&~&\textrm{if }b\geq a\\~\\0&~&\textrm{otherwise}\end{align*}\end{cases}\] Prasun Biswas · 7 months, 1 week ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...