Related papers: Another Approach on Power Sums
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:…
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…
In this manuscript we provide a new polynomial pattern. This pattern allows to find a polynomial expansion of the form \[x^{2m+1} = \sum_{k=1}^{x}\sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r,\] where $x,m\in\mathbb{N}$ and $\mathbf{A}_{m,r}$…
We show how to find series expansions for $\pi$ of the form $\pi=\sum_{n=0}^\infty {S(n)}\big/{\binom{mn}{pn}a^n}$, where S(n) is some polynomial in $n$ (depending on $m,p,a$). We prove that there exist such expansions for $m=8k$, $p=4k$,…
We present some properties of the expansion coefficients $a_{mk}$ and $c_{mk}$ of a pair of dual bases, \[ n^m = \sum_{k=2}^m c_{mk} \psi_{k}(n), \] and \[ \psi_m(n) = n + (m-1)(n-1) B_{n-1,m-1}, \] we introduced earlier in…
In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…
The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…
In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…
In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…
We have found several summation formulas that extend Ramanujan's psi sum. First contains a parameter $\alpha=1/N$, $N$ is a positive integer, and transforms to $q$-beta integral in the limit $N\to\infty$. The other is a $q$-analogue of…
We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…
Denote by $\Sigma n^m$ the sum of the $m$-th powers of the first $n$ positive integers $1^m+2^m+\ldots +n^m$. Similarly let $\Sigma^r n^m$ be the $r$-fold sum of the $m$-th powers of the first $n$ positive integers, defined such that…
We discuss various aspects of representation of a polynomial as a sum of monomials (for example, uniqueness of such representation and related estimations).
For integers $n,k \geq 1$, let $S_k(n)$ denote the power sum $1^k +2^k + \cdots + n^k$. In this note, we first recall the minimal recurrence relation connecting $S_k(n)$ and $S_{k-1}(n)$ established by Abramovich (1973). We then discuss an…
By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…