Related papers: An arithmetic theorem and its demonstration

In this paper Euler considers the properties of the pentagonal numbers, those numbers of the form $\frac{3n^2 \pm n}{2}$. He recalls that the infinite product $(1-x)(1-x^2)(1-x^3)...$ expands into an infinite series with exponents the…

Generalization of the Euler polynomials ${{A}_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{m}^{n}}{{x}^{m}}}$ are the polynomials ${{\alpha }_{n}}\left( x \right)={{\left( 1-x…

Translation of the Latin original, "Methodus generalis investigandi radices omnium aequationum per approximationem" (1776). E643 in the Enestrom index. Euler gives a series to find powers of roots of polynomials.

Our work is motivated by the fact that the norms of the Eulerian integers are related to the sums of form $a^2-ab+b^2$, providing a natural generalization for problems concerning products over sums or differences of integers. Let $E$ be the…

This is the classical monograph on the combinatorial study of Eulerian polynomials, published in 1970. It has been retyped in TeX and made available on the web with the kind permission of Springer-Verlag. This on-line version has an ouput…

The Euler-Maclaurin summation formula is generalized to a modified form by expanding the periodic Bernoulli polynomials as its Fourier series and taking cuts, which includes both the Euler-Maclaurin summation formula and the Poission…

The aim of this note is to provide a simple proof of some well-known identities and recurrences relating classical Bernoulli and Euler numbers by using the Abel sum of the divergent series $\sum_{n=0}^\infty (-1)^{n} (n+1)^k$, $k$ a…

In 1908 Thue (1) showed that algebraic numbers of the special form $\xi =\sqrt[n]{\frac{a}{b}}$ can, for every positive $\epsilon$, only be sharply approximated by finitely many rational numbers $\frac{p}{q}$ with the following inequality…

We give another proof for \[ \sum_{n=1}^{\infty}\frac{1}{n^2}=\frac{\pi^2}{6} \] that basically follows from the theory of difference equations.

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They…

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

The Erd\"{o}s-Moser equation $ \sum_{i=1}^{m - 1} i^k = m^k $ is a longstanding challenge in number theory, with the only known integer solution being $ (k,m) = (1,3) $. Here, we investigate whether other solutions might exist by using the…

E661 in the Enestrom index. This was originally published as "Variae considerationes circa series hypergeometricas" (1776). In this paper Euler is looking at the asymptotic behavior of infinite products that are similar to the Gamma…

The Euler-MacLaurin summation formula relates a sum of a function to a corresponding integral, with a remainder term. The remainder term has an asymptotic expansion, and for a typical analytic function, it is a divergent (Gevrey-1) series.…

Summation formulae are classical tools in analysis: Taylor-MacLaurin, Euler-MacLaurin, Poisson, Vorono\"i, Circle formulae\ldots We will show how, from a single equation - referred to as the mother-equation - it is possible to unify these…

The Menon-Sury's identity is as follows: \begin{equation*} \sum_{\substack{1 \leq a, b_1, b_2, \ldots, b_r \leq n\\\mathrm{gcd}(a,n)=1}} \mathrm{gcd}(a-1,b_1, b_2, \ldots, b_r,n)=\varphi(n) \sigma_r(n), \end{equation*} where $\varphi$ is…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

We propose a lower estimation for computing quantity of the inverses of Euler's function. We answer the question about the multiplicity of $m$ in the equation $\varphi(x) = m$ \cite{Ford}. An analytic expression for exact multiplicity of $m…

Euler starts with a hypergeometric series F(a, b, c, x), and differentiates it to get a functional relation. This relation is today known as Euler's identity. Then he integrates to get another and ends up with something like Legendre…