# Bernoulli polynomials, Apostol

Define Bernoulli polynomials as: $P_0(x)=1$, $P'_n(x)=nP_{n-1}(x)$, $\int_0^1P_n(x)=0$ if $n\geq1$

Need to prove that for $n\geq2$ we have

$$\sum_{r=1}^{k-1} r^n= \frac{P_{n+1}(k)-P_{n+1}(0)}{n+1}$$

I have already proved that:

$P_n(1)=P_n(0)$ if $n\geq2$ and $P_n(x+1)-P_n(x)=nx^{n-1}$ if $n\geq1$

I tried using induction, but got stuck making the inductive step. Could anybody provide any hints? Thanks!

-

## 1 Answer

If $$P_n(x+1)-P_n(x)=nx^{n-1}$$ then $$\sum_{x=0}^{k-1} [P_n(x+1)-P_n(x)]=\sum_{x=0}^{k-1} nx^{n-1}$$ but the LHS telescopes to $P_n(k)-P_n(0)$.

-
yes, that is clear enough. thank you! –  Sarunas Nov 23 '12 at 22:08
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9866500496864319, "perplexity": 299.33399451861004}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-49/segments/1416931012025.85/warc/CC-MAIN-20141125155652-00015-ip-10-235-23-156.ec2.internal.warc.gz"}