Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

Possible Duplicate:
Finite Sum of Power?

Suppose $f(s,k) = \sum_{n=1}^k n^{-s}$ is the Riemann zeta function truncated at the k-th term. I read on mathoverflow that there is a formula for $f(s,k)$ in terms of Bernoulli numbers, but I can't find it on the web. Would someone happen to know it or could point to a link? I am primarily interested in the case when $s$ is a negative real number.


share|cite|improve this question

marked as duplicate by J. M., Argon, BenjaLim, Rudy the Reindeer, Asaf Karagila Jul 23 '12 at 12:22

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

Thank you all so much! These are wonderful answers and links! – Thad Jul 12 '12 at 21:45

Perhaps that you are thinking at the formula proposed by Woon 'A New Representation of the Riemann Zeta Function zeta(s)'.

share|cite|improve this answer
Thanks for the Edit @Ali Caglayan, – Raymond Manzoni Apr 4 at 23:16

Presumably mathoverflow was talking about Faulhaber's formula $$ \sum_{k=1}^n k^p = \frac{B_{p+1}(n+1)-B_{p+1}(0)}{p+1} $$ in terms of Bernoulli polynomials. If $p$ is a positive integer, then the coefficients of the Bernoulli polynomials are essentially Bernoulli numbers.

share|cite|improve this answer

Faulhaber's polynomial provides the answer when $s \in \mathbb{Z}^{-}$. If $s \in \mathbb{R}^-$, a good approximation can be obtained using Euler-Maclaurin which also contain the Bernoulli numbers.

share|cite|improve this answer

Note that

$$\sum_{n=1}^k n^{-s}=H^{(s)}_k$$

where $H^{(s)}_k$ is the generalized harmonic number.

Some identities are mentioned here, e.g.


share|cite|improve this answer

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