Related papers: Faulhaber's Theorem on Power Sums

Several years ago the second author playing with different "recognizers of real constants", e.g., the LLL algorithm, the Plouffe inverter, etc. found empirically the following formula. Let $p_n/q_n$ denote the $n$th convergent of the…

By Maynard's theorem and the subsequent improvements by the Polymath Project, there exists a positive integer $b\leq 246$ such that there are infinitely many primes $p$ such that $p+b$ is also prime. Let $P_1,...,P_t\in \mathbb{Z}[y]$ with…

The ternary Goldbach conjecture states that every odd number $n\geq 7$ is the sum of three primes. The estimation of the Fourier series $\sum_{p\leq x} e(\alpha p)$ and related sums has been central to the study of the problem since Hardy…

Let $\mathcal{U}$ be the set of positive odd integers that cannot be represented as the sum of a prime and a power of two. In this paper, we prove that $\mathcal{U}$ is not a union of finitely many infinite arithmetic progressions and a set…

The classical Eulerian polynomials $A_n(t)$ are known to be gamma positive. Define the positive Eulerian polynomial $\mathsf{AExc^{+}}_n(t)$ as the polynomial obtained when we sum excedances over the alternating group. We show that…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers $D_k$ and polynomials $D_k(z)$. Let $v\in\bN$ and $p$ be an odd prime. It is proved that, for any…

We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.

We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.

Associated to each random variable $Y$ having a finite moment generating function, we introduce a different generalization of the Stirling numbers of the second kind. Some characterizations and specific examples of such generalized numbers…

We combine the Riemann-Hilbert approach with the techniques of Banach algebras to obtain an extension of Baxter's Theorem for polynomials orthogonal on the unit circle. This is accomplished by using the link between the negative Fourier…

The modified B_{n}^{*} = \sum_{r=0}^{n} \binom{n+r}{2r} \frac{B_{r}}{n+r}, \quad n > 0 introduced by D. Zagier in 1998 are extended to the polynomial case by replacing $B_{r}$ by the Bernoulli polynomials $B_{r}(x)$. Properties of these new…

The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…

We consider the effective resummation of a Borel sum by its associated factorial series expansion. Our approach provides concrete estimates for the remainder term when truncating this factorial series. We then generalize a theorem of…

We develop complex Jacobi, Gegenbauer and Chebyshev polynomial expansions for the kernels associated with power-law fundamental solutions of the polyharmonic equation on d-dimensional Euclidean space. From these series representations we…

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

We consider formal power series $ f(x) = a_1 x + a_2 x^2 + \cdots $ $(a_1 \neq 0)$, with coefficients in a field. We revisit the classical subject of iteration of formal power series, the n-fold composition $f^{(n)}(x)=f(f(\cdots…

A natural number is a binary $k$'th power if its binary representation consists of $k$ consecutive identical blocks. We prove an analogue of Waring's theorem for sums of binary $k$'th powers. More precisely, we show that for each integer $k…

For each odd prime power q, and each integer k, we determine the sum of the k-th powers of all elements x in F_q for which both x and x+1 are squares in F_q^*. We also solve the analogous problem when one or both of x and x+1 is a…

We introduce the inversion polynomial for Dedekind sums $f_b(x)=\sum x^{\operatorname{inv}(a,b)}$ to study the number of $s(a,b)$ which have the same value for given $b$. We prove several properties of this polynomial and present some…