请输入您要查询的字词:

 

单词 ProofOfFaulhabersFormula
释义

proof of Faulhaber’s formula


Theorem 0.1.

If kN,2nZ, then

m=1n-1mk=1k+1i=0k(k+1i)Bink+1-i=1nbk(x)𝑑x

where the Bi are the Bernoulli numbersMathworldPlanetmathPlanetmath and bi the Bernoulli polynomialsMathworldPlanetmathPlanetmath.

The exponential generating function for the Bernoulli numbers is

n=0Bnxnn!=xex-1

We develop an equation involving sums of Bernoulli numbers on one side, and a simple generating involving powers of e that gives us the appropriate sum of powers on the other side. Equating coefficients of powers of x then gives the result.

To get a generating function where the coefficient of xn/n! is m=1n-1mk, we can use

m=0n-1emx=m=0n-1k=0mkxkk!
=k=0(m=1n-1mk)xkk!

But this is also a geometric seriesMathworldPlanetmath, so

k=0n-1ekx=1-enx1-ex
=enx-1xxex-1
=enx-1xl=0Blxll!
=(k=0nk+1k+1xkk!)(l=0Blxll!)
=k=0(i=0j1k-i+1(ki)Bink+1-i)xkk!

Equating coefficients of xk/k! we get

m=1n-1mk=i=0k1k-i+1(ki)Bink+1-i
=i=0kk!(k-i+1)i!(k-i)!Bink+1-i=1k+1i=0k(k+1i)Bink+1-i

which proves the first equality.

If f(x) is a polynomial, write [xr]f(x) for the coefficient of xr in f(x). Then

[xr]bk(x)=1r[xr-1]bk(x)=kr[xr-1]bk-1(x)

and thus if rk, iterating, we get

[xr]bk(x)=(kr)[x0]bk-r(x)=(kr)Bk-r

Then using the fact that bk=kbk-1, we have

1nbk(x)=1k+1(bk+1(n)-bk+1(1))=1k+1r=0k+1[xr]bk+1(x)(nr-1)
=1k+1r=0k+1(k+1r)Bk+1-r(nr-1)=1k+1r=1k+1(k+1r)Bk+1-rnr

Now reverse the order of summation (i.e. replace r by k+1-r) to get

1nbk(x)=1k+1r=0k(k+1k+1-r)Brnk+1-r=1k+1r=0k(k+1r)Brnk+1-r
随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 20:14:08