Related papers: On Amicable Numbers
In 1776, L. Euler proposed three methods, called prima methodus, secunda methodus and tertia methodus, to calculate formulae for double zeta values. However strictly speaking, his last two methods are mathematically incomplete and require…
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 introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
The purpose of this article is to present, in a simple way, an analytic approach to special numbers and polynomials. The approach is based on the derivative polynomials. The paper is, to some extent, a review article, although it contains…
In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…
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…
Translation of "Methodus succincta summas serierum infinitarum per formulas differentiales investigandi" (1780). Euler wants to represent some given series of functions S(x)=X(x)+X(x+1)+X(x+2)+etc. in a different way. He writes S as a…
The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…
Several different versions of the theory of numerosities have been introduced in the literature. Here, we unify these approaches in a consistent frame through the notion of set of labels, relating numerosities with the Kiesler field of…
While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…
This is a replacement paper. There are 6 chapters. The first two chapters are introductory. The third chapter is on extremal graph theory. The fourth chapter is about algebra in graph theory. The fifth chapter is focused on algorithms. The…
The purpose of this paper is to give some new identities for the Bernoulli, the Euler and the Genocchi numbers and polynomials.
We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…
This paper does exactly what the title says it does. It expands the given series to arrive at the familiar "pentagonal number" expansion, also known as the pentagonal number theorem, and recalls its application to partition numbers. The…
Translated from the Latin original, "Theorema arithmeticum eiusque demonstratio", Commentationes arithmeticae collectae 2 (1849), 588-592. E794 in the Enestroem index. For m distinct numbers a,b,c,d,...,\upsilon,x this paper evaluates \[…
Carlitz has introduced an interesting $q$-analogue of Frobenius-Euler numbers in [4]. He has indicated a corresponding Stadudt-Clausen theorem and also some interesting congruence properties of the $q$-Euler numbers. In this paper we give…
We fix a gap in the proof of a result in our earlier paper "Generalised notions of amenability, II" (J. Funct. Anal. 254 (2008) 1776-1810), and so provide a new proof to a characterization of amenability for Beurling algebras. The result…
This translation has been withdrawn due to certain imperfections and mistakes, which are corrected in the version uploaded at The Euler Archive (see E65 at http://www.eulerarchive.org/)