Related papers: On Amicable Numbers
In this article, Joseph-Louis Lagrange analyzed those numbers which may be represented by the quadratic form $Bt^2 + Ctu + Du^2$. After proving a few theorems on the divisors of such numbers (and their possible forms), Lagrange developed a…
Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…
In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of…
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…
It is a survey of the main results on abstract characterizations of algebras of $n$-place functions obtained in the last 40 years. A special attention is paid to those algebras of $n$-place functions which are strongly connected with groups…
Hankel determinants of sequences related to Bernoulli and Euler numbers have been studied before, and numerous identities are known. However, when a sequence is shifted by one unit, the situation often changes significantly. In this paper…
In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…
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…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
The diameter of a graph is the maximum distance between pairs of vertices in the graph. A pair of vertices whose distance is equal to its diameter are called diametrically opposite vertices. The collection of shortest paths between…
In this paper, we will define general Eulerian numbers and Eulerian polynomials based on general arithmetic progressions. Under the new definitions, we have been successful in extending several well-known properties of traditional Eulerian…
Schanuel has pointed out that there are mathematically interesting categories whose relationship to the ring of integers is analogous to the relationship between the category of finite sets and the semi-ring of non-negative integers. Such…
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
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…
In this paper we study the higher-order Euler numbers and polynomials and we introduce the mutiple zeta functions which interpolate higher-order Euler polynomials and numbers at negative integers
This article surveys the Euler calculus - an integral calculus based on Euler characteristic - and its applications to data, sensing, networks, and imaging.
Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice…
Euler proves that the sum of two 4th powers can't be a 4th power and that the difference of two distinct non-zero 4th powers can't be a 4th power and Fermat's theorem that the equation x(x+1)/2=y^4 can only be solved in integers if x=1 and…
In this paper, we study some properties of umbral calculus related to Appell sequence. From those properties, we derive new and interesting identities of Frobenius-Euler polynomials.
Euler noted the relation $6^3=3^3+4^3+5^3$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and…