I mean like the formula for $\sum^n_{j=1}j$, or $\sum^n_{j=1}j^2$ extended to things like $\sum^n_{j=1}j^{1.5}$, etc.
3 Answers
There is no "simple" formula for an exact evaluation of the sum for non-integers like there is for the integer cases, by which I mean there is no polynomial in $n$ with rational coefficients that yields the desired sum, like there are for the integer cases.
However we know the approximate behaviour of the value of the sum quite well. By the Euler-Maclaurin summation formula (or you could think of the following as just an application of the trapezoidal approximation to integrals) we have:
$$ \sum_{k=1}^n k^s = \frac{n^{s+1} }{s+1} + \frac{n^s}{2} + \mathcal{O}(n^{s-1} ) $$
where $ s>0.$
- 35,127
-
How about for $\sum^n_{j=1}j^s$, s>0, not the reciprocal? Thank you for this approximation. – DumbQuestion Nov 16 '11 at 06:19
-
@DumbQuestion Sorry, I made a foolish typo! See the above edited version. – Ragib Zaman Nov 16 '11 at 07:41
-
@RagibZaman Do you have a reference for the equation that you wrote above? – Uriel Herrera Dec 23 '19 at 04:51
-
@UrielHerrera The Wikipedia articles on Euler-Maclaurin summation and the Trapezoidal rule are decent references. The article on 'Faulhaber's Formula' may also be interesting to you for this particular case. – Ragib Zaman Dec 23 '19 at 05:03
-
@RagibZaman Thank you for the info. – Uriel Herrera Dec 23 '19 at 19:52
-
1This is an old answer but I have been looking for this ALL DAY and this is exactly what I want. Thank you! – Joshua Nixon Jan 13 '21 at 13:41
-
@JoshuaNixon I'm always glad when my answers continue to help people long after I've written them! – Ragib Zaman Jan 14 '21 at 13:17
The generalized harmonic numbers
$$H_n^{(p)}=\sum_{k=1}^n \frac1{k^p}$$
can be expressed in terms of certain special functions.
One can represent them in terms of Hurwitz zeta functions:
$$H_n^{(p)}=\zeta (p)-\zeta (p,k+1)$$
or equivalently in terms of polygamma functions. See this for details.
- 75,051
The bernoulli-polynomials, or better: their replacement by the use of $\small \zeta() $-terms (call them $\small \zeta()$-polynomials) can be generalized to fractional arguments at the $\small \zeta() $-s . However, while the bernoulli-/zeta-polynomials have finitely many terms at integer exponents due to the vanishing binomial-cofactors, that cofactors do not vanish if the exponent is noninteger, so we get infinite series for fractional exponents.
Define the m'th $\small \zeta()$-polynomial (which sums the powers of exponent m)
$$ z_m(x)=\sum_{c=0}^{\infty} \zeta(-(m-c))\binom{m}{c} x^c $$ .
For integer m this reduces to a finite number of terms
$$ z_m(x)=\sum_{c=0}^{m} \zeta(-(m-c))\binom{m}{c} x^c - {1 \over m+1} x^{m+1} $$
and is identical to the integrals of the bernoulli-polynomials (the Faulhaber's-and Bernoulli's version of the sum-of-like-powers problem). The requested sum of consecutive powers s(a,b,m) is then $\small s(a,b,m)= z_m(a)- z_m(b+1) $
(This answer crossed just with J.M.'s answer)
- 34,920