4
$\begingroup$

Wolfram alpha is able to compute this sum: $$ \sum_{j=1}^n \binom{j}{2} = \frac{1}{6}(n-1)n(n+1). $$

How can Wolfram alpha do it? What kind of algorithm does it use?

$\endgroup$
  • $\begingroup$ You might be able to get specifics from Mathematica. $\endgroup$ – Raphael Apr 29 '14 at 10:21
2
$\begingroup$

It uses algorithms discussed in the book A=B by Petkovšek, Wilf and Zeilberger. These algorithms can compute a closed-form expression for a summation of rational functions (in your case, the rational function is $j(j-1)/2$), or determine that no such closed-form expression exists.

| cite | improve this answer | |
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.