A q-Analogue of Faulhaber's Formula for Sums of Powers

We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.

We will show that $(1-q)(1-q^2)\dots (1-q^m)$ is a polynomial in $q$ with coefficients from $\{-1,0,1\}$ iff $m=1,\ 2,\ 3,$ or $5$ and explore some interesting consequences of this result. We find explicit formulas for the $q$-series coefficients of $(1-q^2)(1-q^3)(1-q^4)(1-q^5)\dots$ and $(1-q^3)(1-q^4)(1-q^5)(1-q^6)\dots$. In doing so, we extend certain observations made by Sudler in 1964. We also discuss the classification of the products $(1-q)(1-q^2)\dots (1-q^m)$ and so...

The Bernoulli numbers b_0,b_1,b_2,.... of the second kind are defined by \sum_{n=0}^\infty b_nt^n=\frac{t}{\log(1+t)}. In this paper, we give an explicit formula for the sum \sum_{j_1+j_2+...+j_N=n, j_1,j_2,...,j_N>=0}b_{j_1}b_{j_2}...b_{j_N}. We also establish a q-analogue for \sum_{k=0}^n b_kb_{n-k}=-(n-1)b_n-(n-2)b_{n-1}.

In this note, we first review the novel approach to power sums put forward recently by Muschielok in arXiv:2207.01935v1, which can be summarized by the formula $S_m^{(a)}(n) = \sum_{k} c_{mk} \psi_k^{(a)}(n)$, where the $c_{mk}$'s are the expansion coefficients and where the basis functions $\psi_m^{(a)}(n)$ fulfil the recursive property $\psi_m^{(a+1)}(n)= \sum_{i=1}^n \psi_m^{(a)}(i)$. Then, we point out a number of supplementary facts concerning the said approach not conte...

Early 17th-century mathematical publications of Johann Faulhaber contain some remarkable theorems, such as the fact that the $r$-fold summation of $1^m,2^m,...,n^m$ is a polynomial in $n(n+r)$ when $m$ is a positive odd number. The present paper explores a computation-based approach by which Faulhaber may well have discovered such results, and solves a 360-year-old riddle that Faulhaber presented to his readers. It also shows that similar results hold when we express the sums...

About four centuries ago, Johann Faulhaber developed formulas for the power sum $1^n + 2^n + \cdots + m^n$ in terms of $m(m+1)/2$. The resulting polynomials are called the Faulhaber polynomials. We first give a short survey of Faulhaber's work and discuss the results of Jacobi (1834) and the less known ones of Schr\"oder (1867), which already imply some results published afterwards. We then show, for suitable odd integers $n$, the following properties of the Faulhaber polynom...

This paper analyzes over 30 types of q-series and the asymptotic behavior of their expansions. A method is described for deriving further asymptotic formulas using convolutions of generating functions with subexponential growth. All variables in the article are integers.

We present some elementary derivations of summation and transformation formulas for q-series, which are different from, and in several cases simpler or shorter than, those presented in the Gasper and Bahman [1990] "Basic Hypergeometric Series" book (which we will refer to as BHS), the Bailey [1935] and Slater [1966] books, and in some papers; thus providing deeper insights into the theory of q-series. Our main emphasis is on methods that can be used to derive formulas, rather...

The double sum sum_(j=0)^m sum_(i=0)^j (-1)^(j-i) C(m,j) C(j,i) C(j+k+qi,j+k) with free nonnegative integer parameters k and q is rewritten as hypergeometric series. Efficient formulas to generate the C-finite ordinary generating functions are presented.

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved: $$\sum_{x=1}^{m}x^{n}=(-1)^{n}m(m+1)(-\frac{1}{2}+\sum_{i=2}^{n}a_i(m+2)(m+3)...(m+i)),$$ here $a_i=\frac{1}{i+1}\sum_{k=1}^{i}\frac{(-1)^{k}k^{n}}{k!(i-k)!}$, $(i=2,3,...,n-1)$, $a_n=\frac{(-1)^n}{n+1}$. Note that this formula does not contain Bernoulli numbers.