English
Related papers

Related papers: New recurrences for divisor sum functions and tria…

200 papers

Translation from the Latin of Euler's "Observatio de summis divisorum" (1752). E243 in the Enestroem index. The pentagonal number theorem is that $\prod_{n=1}^\infty (1-x^n)=\sum_{n=-\infty}^\infty (-1)^n x^{n(3n-1)/2}$. This paper assumes…

History and Overview · Mathematics 2009-07-18 Leonhard Euler , Jordan Bell

Translation from the Latin of Euler's "Demonstratio theorematis circa ordinem in summis divisorum observatum" (1760). E244 in the Enestroem index. In his previous paper E243, Euler stated the pentagonal number theorem and assuming it proved…

History and Overview · Mathematics 2009-07-30 Leonhard Euler , Jordan Bell

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…

Number Theory · Mathematics 2025-10-03 A. David christopher

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…

Combinatorics · Mathematics 2010-09-21 Giuseppe Scollo

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…

Number Theory · Mathematics 2024-12-24 Tapas Bhowmik , Wei-Lun Tsai , Dongxi Ye

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

``In this paper we give the history of Leonhard Euler's work on the pentagonal number theorem, and his applications of the pentagonal number theorem to the divisor function, partition function and divergent series. We have attempted to give…

History and Overview · Mathematics 2007-05-23 Jordan Bell

Ramanujan gave a recurrence relation for the partition function in terms of the sum of the divisor function $\sigma(n)$. In 1885, J.W. Glaisher considered seven divisor sums closely related to the sum of the divisors function. We develop a…

Number Theory · Mathematics 2022-08-03 Hartosh Singh Bal , Gaurav Bhatnagar

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 present Euler-type recurrence relations for some partition functions. Some of our results provide new recurrences for the number of unrestricted partitions of $n$, denote by $p(n)$. Others establish recurrences for partition functions…

Combinatorics · Mathematics 2020-07-16 Robson da Silva , Pedro Diniz Sakai

In this paper, we find a new recurrence formula fo the Euler zeta functions.

Classical Analysis and ODEs · Mathematics 2015-12-24 Joonhyung Kim

We present some Euler-type recurrences for the partition function $p(n)$.

Combinatorics · Mathematics 2018-11-26 Yuriy Choliy , Louis W. Kolitsch , Andrew V. Sills

We obtain recurrences for smallest parts functions which resemble Euler's recurrence for the ordinary partition function. The proofs involve the holomorphic projection of non-holomorphic modular forms of weight 2.

Number Theory · Mathematics 2015-04-15 Scott Ahlgren , Nickolas Andersen

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…

History and Overview · Mathematics 2007-05-23 Leonhard Euler

For a finite sequence of positive integers $A=\{a_j\}_{j=1}^{k},$ we prove a recursion for divisor function $\sigma_{x}^{(A)}(n)=\sum_{d|n,\enskip d\in A}d^x.$ As a corollary, we give an affirmative solution of the problem posed in 1969 by…

Number Theory · Mathematics 2009-03-24 Vladimir Shevelev

We consider relations between the pairs of sequences, $(f, g_f)$, generated by the Lambert series expansions, $L_f(q) = \sum_{n \geq 1} f(n) q^n / (1-q^n)$, in $q$. In particular, we prove new forms of recurrence relations and matrix…

Number Theory · Mathematics 2017-07-06 Maxie D. Schmidt

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…

History and Overview · Mathematics 2023-09-01 Alexander Aycock

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

In this paper we present a simple method for deriving recurrence relations and we apply it to obtain two equations involving the Lerch Phi function and sums of Bernoulli and Euler polynomials. Connections between these results and those…

Number Theory · Mathematics 2007-05-23 Marco Dalai

Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that…

History and Overview · Mathematics 2019-12-10 David J. Pengelley
‹ Prev 1 2 3 10 Next ›