English
Related papers

Related papers: An integration of Euler's pentagonal partition

200 papers

We prove that for a positive integer a the integer sequence P(n) satisfying for all n, -infty<n<infty, the recurrence P(n)=a+P(n-phi(a)), phi(a) the Euler function, generates in increasing order all integers P(n) coprime to a.The finite…

Number Theory · Mathematics 2014-02-05 Constantin M. Petridi

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

Number Theory · Mathematics 2011-06-23 Mohamed El Bachraoui

We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…

Combinatorics · Mathematics 2024-06-24 Yen-Chi Roger Lin , Shu-Yen Pan

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…

Combinatorics · Mathematics 2020-02-28 Martin Klazar

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Number Theory · Mathematics 2011-12-30 Vladimir Shevelev , Peter J. C. Moses

We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.

Classical Analysis and ODEs · Mathematics 2007-05-23 Peng Gao

The generalized hyperharmonic numbers $h_n^{(m)}(k)$ are defined by means of the multiple harmonic numbers. We show that the hyperharmonic numbers $h_n^{(m)}(k)$ satisfy certain recurrence relation which allow us to write them in terms of…

Number Theory · Mathematics 2018-01-22 Ce Xu

Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…

Mathematical Physics · Physics 2013-11-19 M. I. Krivoruchenko

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…

Combinatorics · Mathematics 2013-05-09 Andrey Sarantsev

We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.

Number Theory · Mathematics 2011-05-02 Mohamed El Bachraoui

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…

Classical Analysis and ODEs · Mathematics 2010-03-29 Markus Mueller , Dierk Schleicher

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

Combinatorics · Mathematics 2017-05-16 Shishuo Fu , Dazhao Tang

E158 in the Enestrom index. Translation of the Latin original "Observationes analyticae variae de combinationibus" (1741). This paper introduces the problem of partitions, or partitio numerorum (the partition of integers). In the first part…

History and Overview · Mathematics 2007-11-26 Leonhard Euler

We study a reproducing kernel Hilbert space of functions defined on the positive integers and associated to the binomial coefficients. We introduce two transforms, which allow us to develop a related harmonic analysis in this Hilbert space.…

Complex Variables · Mathematics 2014-12-19 Daniel Alpay , Palle Jorgensen

A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…

Mathematical Physics · Physics 2009-11-11 Satoru Saito , Noriko Saitoh

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

General Mathematics · Mathematics 2008-06-30 Dimitris Sardelis

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…

Classical Analysis and ODEs · Mathematics 2019-03-25 Sergio A. Carrillo

We derive simple linear, inhomogeneous recurrences for the variance of the index by utilising the fact that the generating function for the distribution of the number of positive eigenvalues of a Gaussian unitary ensemble is a…

Classical Analysis and ODEs · Mathematics 2011-10-06 N. S. Witte , P. J. Forrester

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Combinatorics · Mathematics 2008-01-19 Milan Janjic