Related papers: An Explicit Formula For The Divisor Function
A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…
We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over the rationals.
We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2\pi m\theta_1)\sin(2\pi n\theta_2)$, where $\theta_i (0<\theta_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions,…
In this paper we study linear correlations of the divisor function tau(n) = sum_{d|n} 1 using methods developed by Green and Tao. For example, we obtain an asymptotic for sum_{n,d} tau(n) tau(n+d) ... tau(n+ (k-1)d).
Under general conditions, the equation $g(x^1, ..., x^q, y) = 0$ implicitly defines $y$ locally as a function of $x^1, ..., x^q$. In this article, we express divided differences of $y$ in terms of divided differences of $g$, generalizing a…
Techniques are presented for calculating directly the scalar functional determinant on the Euclidean d-ball. General formulae are given for Dirichlet and Robin boundary conditions. The method involves a large mass asymptotic limit which is…
We study the distribution of divisors of Euler's totient function and Carmichael's function. In particular, we estimate how often the values of these functions have "dense" divisors.
We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…
Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…
In this paper, a new method for investigating Dirichlet's divisor problem is developed. For this purpose, integer points under the graph of a hyperbola are studied. Since many investigations in this direction focus on direct estimates of…
New unconditional estimates of the divisor and totient functions are contributed to the literature. These results are consistent with the Riemann hypothesis and seem to solve the Nicolas inequality for all sufficiently large integers.
In this article we discuss an important students' misconception about derivatives, that the expression of the derivative of the function contains the information as to whether the function is differentiable or not where the expression is…
As in algebraic geometry, an effective divisor class on a vertex-weighted graph is called special if also its residual class is effective. We study the question, when this is true already on the level of divisors; that is, when there exists…
The Dirichlet divisor problem is used as a model to give a conjecture concerning the conditional convergence of the Dirichlet series of an L-function.
We investigate the density properties of generalized divisor functions $\displaystyle f_s(n)=\frac{\sum_{d|n}d^s}{n^s}$ and extend the analysis from the already-proven density of $s=1$ to $s\geq0$. We demonstrate that for every $s>0$, $f_s$…
Let $3\leqslant k\leqslant9$ be a fixed integer, $p$ be a prime and $d(n)$ denote the Dirichlet divisor function. We use $\Delta(x)$ to denote the error term in the asymptotic formula of the summatory function of $d(n)$. The aim of this…
We exploit the properties of a sequence of functions that approximate the divisor functions and combine them with an analytical formula of a delta-like sequence to give a new proof of a theorem of Gronwall on the asymptotic of the divisor…
We obtain series expansion formulas for the Hadamard fractional integral and fractional derivative of a smooth function. When considering finite sums only, an upper bound for the error is given. Numerical simulations show the efficiency of…
An effective method of computing division polynomials in terms of Mumford coordinates is presented. As an example, division polynomials for $3$- and $4$-torsion divisors on a genus two curve are obtained explicitly in terms of Mumford…
Consider a one-parameter family of algebraic varieties degenerating to a reducible one. Our main result is a formula for the fundamental cycle of the limit subscheme of any family of effective Cartier divisors. The formula expresses this…