Related papers: Various analytic observations on combinations
An interplay between the Lambert series and Euler's Pentagonal Number Theorem gives an Euler-type recurrence relation for any given arithmetical function. As consequences of this, we present Euler-type recurrence relations for some…
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…
Euler discovered recurrence for divisor sum functions as a consequence of the pentagonal numbers theorem. With similar idea and also motivated by Ewell's work in 1977, we prove new recurrences for certain divisor sum functions and…
Linear harmonic number sums had been studied by a variety of authors during the last centuries, but only few results are known about nonlinear Euler sums of quadratic or even higher degree. The first systematic study on nonlinear Euler sums…
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.…
Euler evaluates the integrals in the title and recognizes a recursion between them, which he then uses to give continued fractions for the log and arctan. The paper is translated from Euler's Latin original into German.
Translation (by J.B.) from the original Latin of Euler's "De infinities infinitis gradibus tam infinite magnorum quam infinite parvorum" (1780). E507 in the Enestr\"om index. Euler discusses orders of infinity in this paper. In other words…
Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…
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…
When people mention the mathematical achievements of Euclid, his geometrical achievements always spring to mind. But, his Number-Theoretical achievements (See Books 7, 8 and 9 in his magnum opus \emph{Elements} [1]) are rarely spoken. The…
In this note we will present how Euler's investigations on various different subjects lead to certain properties of the Legendre polynomials. More precisely, we will show that the generating function and the difference equation for the…
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
E30 in the Enestrom index. Translated from the Latin original "De formis radicum aequationum cuiusque ordinis coniectatio" (1733). For an equation of degree n, Euler wants to define a "resolvent equation" of degree n-1 whose roots are…
This is the translation of Leonhard Euler's paper "De Seriebus divergentibus" written in Latin into English. Leonhard Euler defines and discusses divergent series. He is especially interested in the example $1!-2!+3!-\text{etc.}$ and uses…
Euler gives an asymptotic approximation for the function f(x) and recognizes that he is trying to interpolate the factorial function introduced in E19 "De progressionibus transcendentibus seu quarum termini generales algebraice dari…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the…
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…
The Catalan numbers $C_k$ were first studied by Euler, in the context of enumerating triangulations of polygons $P_{k+2}$. Among the many generalizations of this sequence, the Fuss-Catalan numbers $C^{(d)}_k$ count enumerations of…
We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…