English
Related papers

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

200 papers

Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we…

Combinatorics · Mathematics 2015-10-01 Soumyabrata Pal , Shankar M. Venkatesan

Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.

Number Theory · Mathematics 2007-05-23 T. Kim

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

General Mathematics · Mathematics 2025-09-16 Brahim Mittou

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…

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

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…

Number Theory · Mathematics 2019-10-08 Matthew C. Lettington , Karl Michael Schmidt

In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 \times \infty$ board with…

Combinatorics · Mathematics 2018-07-26 Dennis Eichhorn , Hayan Nam , Jaebum Sohn

Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential…

Combinatorics · Mathematics 2018-04-17 Francis N. Castro , Robin Chapman , Luis A. Medina , L. Brehsner Sepúlveda

Additive divisor sums play a prominent role in the theory of the moments of the Riemann zeta function. There is a long history of determining sharp asymptotic formula for the shifted convolution sum of the ordinary divisor function. In…

Number Theory · Mathematics 2017-05-19 Nathan Ng , Mark Thom

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…

Number Theory · Mathematics 2008-08-14 Taekyun Kim

We construct a continuous function on the torus with almost everywhere divergence triangular sums of double Fourier series. An analogous theorem we also prove for eccentrical spherical sums.

Classical Analysis and ODEs · Mathematics 2017-02-10 Grigori Karagulyan

The principal aim of this article is to establish an iteration method on the space of resurgent functions. We discuss endless continuability of iterated convolution products of resurgent functions and derive their estimates developing the…

Classical Analysis and ODEs · Mathematics 2016-10-20 Shingo Kamimoto

Paul Erdos and Carl Pomerance have proofs on an asymptotic upper bound on the number of preimages of Euler's totient function $\phi$ and the sum-of-divisors functions $\sigma$. In this paper, we will extend the upper bound to the number of…

Number Theory · Mathematics 2024-01-09 Agbolade Patrick Akande

We provide a unified, probabilistic approach using renewal theory to derive some novel limits of sums for the normalized binomial coefficients and for the normalized Eulerian numbers. We also investigate some corresponding results for their…

Combinatorics · Mathematics 2019-03-18 Meng Li , Ron Goldman

In a recent paper, Merca posed three conjectures on congruences for specific convolutions of a sum of odd divisor functions with a generating function for generalized $m$-gonal numbers. Extending Merca's work, we complete the proof of these…

Number Theory · Mathematics 2021-07-22 Kaya Lakein , Anne Larsen

The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading…

Number Theory · Mathematics 2012-07-05 Richard J. Mathar

We consider some parametrized classes of multiple sums first studied by Euler. Identities between meromorphic functions of one or more variables generate reduction formulae for these sums.

Classical Analysis and ODEs · Mathematics 2007-06-13 David Borwein , Jonathan M. Borwein , David M. Bradley

Windowed recurrences are sliding window calculations where a function is applied iteratively across the window of data, and are ubiquitous throughout the natural, social, and computational sciences. In this monograph we explore the…

Data Structures and Algorithms · Computer Science 2026-02-13 David K. Maslen , Daniel N. Rockmore

Erd\H{o}s first conjectured that infinitely often we have $\varphi(n) = \sigma(m)$, where $\varphi$ is the Euler totient function and $\sigma$ is the sum of divisor function. This was proven true by Ford, Luca and Pomerance in 2010. We ask…

Number Theory · Mathematics 2018-09-07 Patrick Meisner

We investigate a relationship between MacMahon's generalized sum-of-divisors functions and Chebyshev polynomials of the first kind. This determines a recurrence relation to compute these functions, as well as proving a conjecture of…

Number Theory · Mathematics 2010-11-02 George E. Andrews , Simon CF Rose

A generating function is given for the number, $E(l,k)$, of irreducible $k$-fold Euler sums, with all possible alternations of sign, and exponents summing to $l$. Its form is remarkably simple: $\sum_n E(k+2n,k) x^n = \sum_{d|k}\mu(d)…

High Energy Physics - Theory · Physics 2008-02-03 D. J. Broadhurst