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

For integer $k \geq 0$, let $S_k$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. For any given $k$, the power sum $S_k$ can in principle be determined by differentiating $k$ times (with respect to $x$) the associated exponential generating function $\sum_{k=0}^{\infty}S_k x^k/k!$, and then taking the limit of the resulting differentiated function as $x$ approaches $0$. In this paper, we exploit this method to establish a coup...

In this paper we consider a $q$-analog of the Borel-Laplace summation process defined by Marotte and the second author, and consider two series solutions of linear $q$-difference equations with slopes $0$ and $1$. The latter are $q$-summable and we prove that the product of the series is $q$-(multi)summable and its $q$-sum is the product of the $q$-sum of the two series. This is a first step in showing the conjecture that the $q$-summation process is a morphism of rings. We p...

In this paper, we will study p-adic q-expansion of alternating sums of powers. From these properties, we derive some interesting properties related to p-adic q-expansion of alternating sums of powers

Let $\lambda =\left( \lambda_{1},\lambda_{2},...,\lambda_{r}\right) $ be an integer partition, and $\left[p_{\lambda }\right] $ the $q$-analog of the symmetric power function $%p_{\lambda }$. This $q$-analogue has been defined as a special case, in the author's previous article: "A $q$-analog of certain symmetric functions and one of its specializations". Here, we prove that a large part of the classical relations between $p_{\lambda }$, on one hand, and the elementary and co...

What is a general expression for the sum of the first n integers, each raised to the mth power, where m is a positive integer? Answering this question will be the aim of the paper....We will take the unorthodox approach of presenting the material from the point of view of someone who is trying to solve the problem himself. Keywords: analogy, Johann Faulhaber, finite sums, heuristics, inductive reasoning, number theory, George Polya, problem solving, teaching of mathematics

Any power series with unit constant term can be factored into an infinite product of the form $\prod_{n\geq 1} (1-q^n)^{-a_n}$. We give direct formulas for the exponents $a_n$ in terms of the coefficients of the power series, and vice versa, as sums over partitions. As examples, we prove identities for certain partition enumeration functions. Finally, we note $q$-analogues of our enumeration formulas.

For an integer $q\ge2$, a $q$-recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of~$q$. In this article, $q$-recursive sequences are studied and the asymptotic behavior of their summatory functions is analyzed. It is shown that every $q$-recursive sequence is $q$-regular in the sense of Allouche and Shallit and that a $q$-linear representation of the sequence can be computed easily by using the coefficients from the recurrence...

Using a property of the q-shifted factorial, an identity for q-binomial coefficients is proved, which is used to derive the formulas for the q-binomial coefficient for negative arguments. The result is in agreement with an earlier paper about the normal binomial coefficient for negative arguments. Some new q-binomial summation identities are derived, and the formulas for negative arguments transform some of these summation identities into each other. One q-binomial summation ...

In this note we shall give conditions which guarantee that $\frac{1-q^b}{1-q^a}{n\brack m}\in\mathbb{Z}[q]$ holds. We shall provide a full characterisation for $\frac{1-q^b}{1-q^a}{ka\brack m}\in\mathbb{Z}[q]$. This unifies a variety of results already known in literature. We shall prove new divisibility properties for the binomial coefficients and a new divisibility result for a certain finite sum involving the roots of the unity.

In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For example, we show that if $n\ge m-1$ then $$\sum_{i=0}^{\lfloor(m-1)/2\rfloor}(-1)^i\binom{m-1-i}i [n-2i,r-i]_m=2^{n-m+1}.$$ We also apply such results to investigate Bernoulli and Euler polynomials. Our approach depends heavily on an identity e...