Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The Euler-Maclaurin summation formula is \begin{eqnarray} \sum_{k = a}^{b} f(k) = \int_{a}^{b} f(t) \, dt + B_1 (f(a) + f(b)) + \sum_{n = 1}^{N} \frac{B_{2n}}{(2n)!} ( f^{(2n-1)}(b) - f^{(2n-1)}(a) ) + R_{N}, \end{eqnarray} where $B_{n}$ is the $n^{\text{th}}$-Bernoulli number taking $B_{1} = \tfrac{1}{2}$, and the remainder term is bounded by the following \begin{align} |R_{N}| \leq \frac{|B_{2N} |}{(2n)!} \int_{a}^{b} | f^{(2N)}(t) | \, dt. \end{align} for any arbitrary positive integer $N$. Is there a similar formula for nested sums of the form, \begin{eqnarray} \sum_{k_1 = a_1}^{b_1} \cdots \sum_{k_n = a_n}^{b_n} f(k_1, \dots, k_n). \end{eqnarray}


share|cite|improve this question

Yes! There's a whole chapter about it in this book.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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