Related papers: Faulhaber's Theorem on Power Sums
Translation from the Latin original, "Inventio summae cuiusque seriei ex dato termino generali" (1735). E47 in the Enestrom index. In this paper Euler derives the Euler-Maclaurin summation formula, by expressing y(x-1) with the Taylor…
Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…
Let $\mathbf{P}^{m}_{b}(x)$ be a $2m+1$-degree polynomial in $x$ and $b \in \mathbb{R}$ \[ \mathbf{P}^{m}_{b}(x) = \sum_{k=0}^{b-1} \sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r \] where $\mathbf{A}_{m,r}$ are real coefficients. In this…
Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.
It is shown that if every odd integer $n > 5$ is the sum of three primes, then every even integer $n > 2$ is the sum of two primes. A conditional proof of Goldbach's conjecture, based on Cram\'er's conjecture, is presented. Theoretical and…
In the research, with aid of the Fa\`a di Bruno formula, be virtue of several identities for the Bell polynomials of the second kind, with help of two combinatorial identities, by means of the (logarithmically) complete monotonicity of…
We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.
E565 in the Enestrom index. Translated from the Latin original, "De plurimis quantitatibus transcendentibus quas nullo modo per formulas integrales exprimere licet" (1775). Euler does not prove any results in this paper. It seems to me like…
We investigate interconnected aspects of hyperderivatives of polynomials over finite fields, q-th powers of polynomials, and specializations of Vandermonde matrices. We construct formulas for Carlitz multiplication coefficients using…
We generalize five theorems of Leindler on the relations among Fourier coefficients and sum-functions under the more general $NBV$ condition.
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
Erdos conjectured that every odd number greater than one can be expressed as the sum of a squarefree number and a power of two. Subsequently, Odlyzko and McCranie provided numerical verification of this conjecture up to $10^7$ and $1.4\cdot…
In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…
In this paper, we investigate two methods to express the natural powers of $2$ as sums over integer partitions. First we consider a formula by N. J. Fine that allows us to express a binomial coefficient in terms of multinomial coefficients…
Consider an irreducible finite Coxeter system. We show that for any nonnegative integer n the sum of the nth powers of the Coxeter exponents can be written uniformly as a polynomial in four parameters: h (the Coxeter number), r (the rank),…
A generalisation of the odd Bernoulli polynomials related to the quantum Euler top is introduced and investigated. This is applied to compute the coefficients of the spectral polynomials for the classical Lam\'e operator.
We consider a variety of Euler's conjecture, i.e., whether the Diophantine system \[\begin{cases} n=a_{1}+a_{2}+\cdots+a_{s-1}, a_{1}a_{2}\cdots a_{s-1}(a_{1}+a_{2}+\cdots+a_{s-1})=b^{s} \end{cases}\] has solutions…
Historically, the polylogarithm has attracted specialists and non-specialists alike with its lovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in…
An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.