Related papers: An Explicit Formula For The Divisor Function

The integer division of a numerator n by a divisor d gives a quotient q and a remainder r. Optimizing compilers accelerate software by replacing the division of n by d with the division of c * n (or c * n + c) by m for convenient integers c…

In this paper, we consider the general divisor functions over Piatetski-Shapiro sequences. We can give some general results which contain some special divisor functions. Precisely, we extend the divisor problem over Piatetski-Shapiro…

Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in…

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem. Our main results are the asymptotic formulas $$ \int_1^X \Delta^3(x){\rm d}x = BX^{7/4} + O_\epsilon(X^{\beta+\epsilon}) \qquad(B > 0) $$ and $$ \int_1^X…

We give a closed formula for the Conway function of a splice in terms of the Conway function of its splice components. As corollaries, we refine and generalize results of Seifert, Torres, and Sumners-Woods.

The purpose of this note is to prove an Euler-type formula for partitions of the M\"obius strip. This formula was introduced in our joint paper with R.~Kiwan, "Courant-sharp property for Dirichlet eigenfunctions on the M\"obius strip"…

This paper determines the general formula for describing differentials of composite functions in terms of differentials of their factor functions. This generalises the formula commonly attributed to Faa di Bruno to functions in locally…

By using the $q$-analogue of van der Corput's method we study the divisor function in an arithmetic progression to modulus $q$. We show that the expected asymptotic formula holds for a larger range of $q$ than was previously known, provided…

Let $\Delta^{(k)}(x)$ denote the error term of the $k$-free divisor problem for $k\geq 2$. In this paper we establish an asymptotic formula of the integral $\int_1^T|\Delta^{(k)}(x)|^2dx$ for each $k\geq 4.$

For a positive integer $n$, if $\sigma(n)$ denotes the sum of the positive divisors of $n$, then $n$ is called a deficient perfect number if $\sigma(n)=2n-d$ for some positive divisor $d$ of $n$. In this paper, we prove some results about…

Suppose $a$ and $b$ are two fixed positive integers such that $(a,b)=1.$ In this paper we shall establish an asymptotic formula for the mean square of the error term $\Delta_{a,b}(x)$ of the general two-dimensional divisor problem.

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

The study gives a brief overview of existing modifications of the method of functional separation of variables for nonlinear PDEs. It proposes a more general approach to the construction of exact solutions to nonlinear equations of applied…

Let $N$ be a positive number. We give an asymptotic formula for the sum of $\tau(\gcd(a,b))$ for all $a$ and $b$ with $ab \le N$.

Integer division instruction is generally expensive in most architectures. If the divisor is constant, the division can be transformed into combinations of several inexpensive integer instructions. This article discusses the classic…

This article presents an equivalent formulation of the implicit complementarity problem. We demonstrate that solution of the equivalent formulation is equivalent to the solution of the implicit complementarity problem. Moreover, we provide…

The partition function $p(n)$ has been a testing ground for applications of analytic number theory to combinatorics. In particular, Hardy and Ramanujan invented the "circle method" to estimate the size of $p(n)$, which was later perfected…

For an odd integer $d > 1$ and a finite Galois extension $K/\mathbb{Q}$ of degree $d$, G. L\"{u} and Z. Yang \cite{lu3} obtained an asymptotic formula for the mean values of the divisor function for $K$ over square integers. In this…

The main purpose of this paper is to derive the closed form solution the sequence $(g_n)_{n\in \mathbb{N}}$ of integro-difference equations that is defined recursively as follows: \begin{align*} g_1(x) & = \chi_{(-1/2, 1/2)} (x), g_{n+1}(x)…

We define a Dieudonn\'e module as the module of Dieudonn\'e elements, and set up Dieudonn\'e module theory in a simple way. Under this formulation we give explicit formulae for the duality and the corresponding differential operators.