English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For $k$ a positive integer let $S_k(n) = 1^k + 2^k + \cdots + n^k$, i.e.,$S_k(n)$ is the sum of the first $k$-th powers. Faulhaber conjectured (laterproved by Jacobi) that for $k$ odd, $S_k(n)$ could be written as a polynomialof $S_1(n)$; for example $S_3(n) = S_1(n)^2$. We extend this result and provethat for any $k$ there is a polynomial $g_k(x,y)$ such that $S_k(n) = g(S_1(n),S_2(n))$. The proof yields a recursive formula to evaluate $S_k(n)$ as apolynomial of $n$ that has roughly half the number of terms as the classicalone.

On the sum of $k$-th powers in terms of earlier sums