Related papers: The divisor function and divisor problem

The integer $d=\prod_{i=1}^s p_i^{b_i}$ is called an exponential divisor of $n=\prod_{i=1}^s p_i^{a_i}>1$ if $b_i \mid a_i$ for every $i\in \{1,2,...,s\}$. Let $\tau^{(e)}(n)$ denote the number of exponential divisors of $n$, where…

Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms…

A simple proof of the classical subconvexity bound $\zeta(1/2+it) \ll_\epsilon t^{1/6+\epsilon}$ for the Riemann zeta-function is given, and estimation by more refined techniques is discussed. The connections between the Dirichlet divisor…

We discuss the significance of some interesting results by Barbara Rokowska about combinatorial constructions. Her interest in finite mathematics and number theory began with an embellishment and detailing of some work by Erdos. Rokowska…

In this paper we obtain a sharp upper bound for the number of solutions to a certain diophantine inequality involving fractions with power denominator. This problem is motivated by a conjecture of Zhao concerning the spacing of such…

Ramanujan investigated maximal order for the number of divisors function by introducing some notion such as (superior) highly composite numbers. He also studied maximal order for other arithmetic functions including the sum of powers of…

We study an asymptotic behavior of the sum $\sum\limits_{n\le x}\frac{\D \tau(n)}{\D \tau(n+a)}$. Here $\tau(n)$ denotes the number of divisors of $n$ and $a\ge 1$ is a fixed integer.

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and let $E(T)$ denote the error term in the asymptotic formula for the mean square of $|\zeta(1/2+it)|$. If $E^*(t) := E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x)…

We obtain a new upper bound for $\sum_{h\le H}\Delta_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the…

What is an interesting number theoretic or a combinatorial characterization of the divisors of 24 amongst all positive integers? In this paper I will provide one characterization in terms of modular multiplication tables. This idea evolved…

The details for the construction of an explicit formula for the divisors function d(n) = #{d | n} are formalized in this article. This formula facilitates a unified approach to the investigation of the error terms of the divisor problem and…

We study the distribution functions of several classical error terms in analytic number theory, focusing on the remainder term in the Dirichlet divisor problem $\Delta(x)$. We first bound the discrepancy between the distribution function of…

In 2016, Yuri Zarhin gave formulas for "dividing a point on a hyperelliptic curve by 2." Given a point $P$ on a hyperelliptic curve $\mathcal{C}$, Zarhin gives the Mumford's representation of every degree $g$ divisor $D$ such that $2(D - g…

In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper is concerned with the precise…

The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…

This survey article on Hilbert's first and second problems is adapted from a one-hour colloquium lecture given at the University of Auckland in May, 2000, just three months before the 100th anniversary of Hilbert's lecture. It includes an…

We provide a writeup of a resolution of Erd\H{o}s Problem #728; this is the first Erd\H{o}s problem (a problem proposed by Paul Erd\H{o}s which has been collected in the Erd\H{o}s Problems website) regarded as fully resolved autonomously by…

Let n be a non-null positive integer and $d(n)$ is the number of positive divisors of n, called the divisor function. Of course, $d(n) \leq n$. $d(n) = 1$ if and only if $n = 1$. For $n > 2$ we have $d(n) \geq 2$ and in this paper we try to…

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|\zeta(1/2+it)|$. If $E^*(t) = E(t) - 2\pi\Delta^*(t/2\pi)$ with $\Delta^*(x) = -\Delta(x) +…

We establish a variety of extensions to the Erdos-Rado Theorem, particularly involving ordinal numbers, and always involving ordinary partition relations. Most of the results can be regarded as consequences of the Ramification Principle,…