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 $τ^{(e)}(n)$ denote the number of exponential divisors of $n$, where $τ^{(e)}(1)=1$ by convention. The aim of the present paper is to establish an asymptotic formula with remainder term for the $r$-th power of the function $τ^{(e)}$, where $r\ge 1$ is an integer. This improves an earlier result of {\sc M. V. Subbarao} [5].
Our paper is devoted to several problems from the field of modified divisors: namely exponential and infinitary divisors. We study the behaviour of modified divisors, sum-of-divisors and totient functions. Main results concern with the asymptotic behaviour of mean values and explicit estimates of extremal orders.
We say that $d$ is an exponential unitary divisor of $n=p_1^{a_1}... p_r^{a_r}>1$ if $d=p_1^{b_1}... p_r^{b_r}$, where $b_i$ is a unitary divisor of $a_i$, i.e., $b_i\mid a_i$ and $(b_i,a_i/b_i)=1$ for every $i\in \{1,2,...,r\}$. We survey properties of related arithmetical functions and introduce the notion of exponential unitary perfect numbers.
We prove an upper bound for the exponential sum associated to a localized $k-$divisor function, i.e., the counting function of the number of ways to write a positive integer $n$ as a product of $k\ge 2$ positive integers, each of them belonging to a specified interval. In particular, this gives an estimate for the exponential sum for the $k-$divisor function, $d_k(n)$.
The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having the same prime factors are called exponentially coprime if $(a_i,b_i)=1$ for every $1\le i\le r$. In the paper we investigate asymptotic properties of certain arithmetic functions involving exponential divisors and exponentially coprime integers.
Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(p^a) = f(a)$ for every prime power $p^a$. We investigate the behaviour of $E^mτ_k$, where $τ_k$ is a $k$-dimensional divisor function and $E^m$ stands for the $m$-fold iterate of $E$. We estimate the error terms of $\sum_{n\le x} E^mτ_k(n)$ for various combinations of $m$ and $k$. We also study properties of $E^mf$ for arbitrary $f$ and sufficiently large $m$. Our study provides a unified approach to functions with exponential divisors. We improve special cases of the Dir…
We consider a problem posed by Shparlinski, of giving nontrivial bounds for rational exponential sums over the arithmetic function $τ(n)$, counting the number of divisors of $n$. This is done using some ideas of Sathe concerning the distribution in residue classes of the function $ω(n)$, counting the number of prime factors of $n$, to bring the problem into a form where, for general modulus, we may apply a bound of Bourgain concerning exponential sums over subgroups of finite abelian groups and for prime modulus some results of Korobov and Shkredov.
Let $\taue_k \colon \Z\to\Z$ be a multiplicative function such that $ \taue_k(p^a) = \sum_{d_1... d_k=a} 1 $. In the present paper we introduce generalizations of $\taue_k$ over the ring of Gaussian integers $\Zi$. We determine their maximal orders by proving a general result and establish asymptotic formulas for their average orders.
We obtain asymptotic for the quantity $\int_0^1 \bigg|\sum_{n\le X}τ_k(n)e(nα)\bigg|dα$ where $τ_k(n) = \sum_{d_1\dots d_k = n} 1$. This follows from a quick application of the circle method. Along the way, we find minor arc bounds for the exponential sum with $τ_k$, and asymptotics for high moments of the Dirichlet kernel.
We obtain an asymptotic formula for the L^1 norm of the exponential sum $M(α) = \sum_{n\le X}τ(n)e(nα)$ where $τ(n) = \sum_{d|n} 1$ is the divisor function. In particular, we show that it is $\sim C\sqrt{X}\log X$ with $C = \frac{18}{π^3} - \frac{12\log 2}{π^3} - \frac{1}{2π}\approx 0.153\dots$.
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this function for many cases. Our proof uses the estimate of exponential sums. We also show uniform results for ideal counting function and relatively $r$-prime lattice points as one of applications.
We give a new non-trivial upper bound for the Selberg integral of the three-divisor function $d_3(n)$. Our method applies our recent conjecture together with Laporta, for the modified Selberg integral of $d_3(n)$, and a kind of modified Gallagher Lemma for the exponential sums.
Given a complex number $c$, define the divisor function $σ_c:\mathbb N\to\mathbb C$ by $σ_c(n)=\sum_{d\mid n}d^c$. In this paper, we look at $\overline{σ_{-r}(\mathbb N)}$, the topological closures of the image of $σ_{-r}$, when $r>1$. We exhibit new lower bounds on the number of connected components of $\overline{σ_{-r}(\mathbb N)}$, bringing this bound from linear in $r$ to exponential. Finally, we discuss the general structure of gaps of $\overline{σ_{-r}(\mathbb N)}$ in order to work towards a possible monotonicity result.
Given a positive integer $n$, the small divisors of $n$ are defined as the positive divisors that do not exceed $\sqrt{n}.$ Ianucci previously classified all $n$ for which the small divisors of $n$ form an arithmetic progression. In this paper, we classify all $n$ for which the small divisors of $n$ form a linear recurrence of order at most two.
An asymptotic formula is proved for the k-fold divisor function averaged over homogeneous polynomials of degree k in k-1 variables coming from incomplete norm forms.
For each positive integer $N$, define $$S'_N \ =\ \{1 < d < \sqrt{N}: d|N\}\mbox{ and }L'_N \ =\ \{\sqrt{N} < d < N : d|N\}.$$ Recently, Chentouf characterized all positive integers $N$ such that the set of small divisors $\{d\le \sqrt{N}: d|N\}$ satisfies a linear recurrence of order at most two. We nontrivially extend the result by excluding the trivial divisor $1$ from consideration, which dramatically increases the analysis complexity. Our first result characterizes all positive integers $N$ such that $S'_N$ satisfies a linear recurrence of order at most two. Moreover, our second result ch…
In this article, we prove an asymptotic formula for mean values of long Dirichlet polynomials with higher order shifted divisor functions, assuming a smoothed additive divisor conjecture for higher order shifted divisor functions. As a consequence of this work, we prove special cases of conjectures of Conrey-Keating on mean values of long Dirichlet polynomials with higher order shifted divisor functions as coefficients.
N. Minculete has introduced a concept of divisors of order $r$: integer $d=p_1^{b_1}\cdots p_k^{b_k} $ is called a divisor of order $r$ of $n=p_1^{a_1}\cdots p_k^{a_k}$ if $d \mid n$ and $b_j\in\{r, a_j\}$ for $j=1,\ldots,k$. One can consider respective divisor function $τ^{(r)}$ and sum-of-divisors function $σ^{(r)}$. In the present paper we investigate the asymptotic behaviour of $\sum_{n\le x} τ^{(r)}(n)$ and $\sum_{n\le x} σ^{(r)}(n)$. We also provide conditional estimates under Riemann hypothesis.
We compute the first and second moments of the divisor-counting function for the Euler-Poincaré characteristic and the trace of Frobenius for the reductions modulo $p$ of a rank 2 Drinfeld module with nontrivial endomorphism ring, as the prime $p$ varies over the primes of ordinary reduction of the Drinfeld module. From these moments we derive the normal order of the number of prime divisors of these invariants.
The integers $n=\prod_{i=1}^r p_i^{a_i}$ and $m=\prod_{i=1}^r p_i^{b_i}$ having the same prime factors are called exponentially coprime if $(a_i,b_i)=1$ for every $1\le i\le r$. We estimate the number of pairs of exponentially coprime integers $n,m\le x$ having the prime factors $p_1,...,p_r$ and show that the asymptotic density of pairs of exponentially coprime integers having $r$ fixed prime divisors is $(ζ(2))^{-r}$.
We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, and other special functions. Some of our results improve the error terms obtained by Bordellès and Cloitre. We formulate certain open problems.
In this article we extend a theorem of Andrews, Crippa, and Simon on the asymptotic behavior of polynomials defined by a general class of recursive equations. Here the polynomials are in the variable $q$, and the recursive definition at step $n$ introduces a polynomial in $n$. Our extension replaces the polynomial in $n$ with either an exponential or periodic function of $n$.
We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too sparse, and we use it to compute the logarithm of the maximum of the divisor function at every degree up to an error of a constant, which is significantly smaller than in the case of the integers, even assuming the Riemann Hypothesis.
Suppose that $n$ is a positive integer. In this paper, we show that the exponential Diophantine equation $$(n-1)^{x}+(n+2)^{y}=n^{z},\ n\geq 2,\ xyz\neq 0$$ has only the positive integer solutions $(n,x,y,z)=(3,2,1,2), (3,1,2,3)$. The main tools on the proofs are Baker's theory and Bilu-Hanrot-Voutier's result on primitive divisors of Lucas numbers.
We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by the minor arc contribution in the circle method, which we lower bound by comparing with suitable auxiliary exponential sums that are easier to understand. As an application, we prove a lower bound of $(1-ε) QN\log(Q^2/N)$ for the variance of the von Mangoldt function $(Λ(n))_{n=1}^{N}$, on the range $\sqrt{N} (\log N)^C \leq Q \leq N$. Previously such a resul…
Let $k$ be a function field of one variable over a finite field with the characteristic not equal to two. In this paper, we consider the prehomogeneous representation of the space of binary quadratic forms over $k$. We have two main results. The first result is on the principal part of the global zeta function associated with the prehomogeneous vector space. The second result is on a mean value theorem for degree zero divisor class groups of quadratic extensions over $k$, which is a consequence of the first one.
Let $Δ(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 $|ζ(1/2 + it)|$. If $E^*(t) = E(t) - 2πΔ^*(t/(2π))$ with $Δ^*(x) = - Δ(x) +2Δ(2x)- {1\over2}Δ(4x)$, then we obtain $$ \int_0^T(E^*(t))^4 dt \ll_εT^{16/19+varepsilon}$$, which is the first non-trivial bound for higher moments of $E^*(t)$. The method of proof also provides an upper bound for sums of fourth powers of mean square integrals of $|ζ(1/2 + it)|$ over well-spaced points. This, in turn, yields a new proof of the twelfth moment estimate for $|ζ(1/2…
Schreier sets have been an object of study since first introduced in 1930 by Jozef Schreier to construct a counterexample to a conjecture of Banach. In 1974 George Andrews found interesting connections between these sets and Fibonacci number, and since then more results of a combinatorial flavor were proven by Chu, Beanland, and Finch-Smith. In parallel Iannucci introduced the concept of a small divisor and characterized all natural numbers whose small divisors are in arithmetic progression, results which were generalized by Chentouf and Chu. Then combining these two ideas, Chu introduced the …
Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We determine the order of magnitude of $H_F(x, y, z)$ uniformly for $y+y/\log^C y < z\le y^2$ and $y\le x^{1-δ}$, showing that the order is the same as the order of $H(x,y,z)$, the number of positive integers $n\le x$ with a divisor in $(y,z]$. Here $C$ is an arbitrarily large constant and $δ>0$ is arbitrarily small.
In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical result which says that a non-degenerate linear recurrence sequence of integers of order k>1 has infinitely many prime divisors.
We show that the expected asymptotic for the sums $\sum_{X < n \leq 2X} Λ(n) Λ(n+h)$, $\sum_{X < n \leq 2X} d_k(n) d_l(n+h)$, and $\sum_{X < n \leq 2X} Λ(n) d_k(n+h)$ hold for almost all $h \in [-H,H]$, provided that $X^{8/33+\varepsilon} \leq H \leq X^{1-\varepsilon}$, with an error term saving on average an arbitrary power of the logarithm over the trivial bound. Previous work of Mikawa, Perelli-Pintz and Baier-Browning-Marasingha-Zhao covered the range $H \geq X^{1/3+\varepsilon}$. We also obtain an analogous result for $\sum_n Λ(n) Λ(N-n)$. Our proof uses the circle method and some oscilla…
The class of Lambert series generating functions (LGFs) denoted by $L_α(q)$ formally enumerate the generalized sum-of-divisors functions, $σ_α(n) = \sum_{d|n} d^α$, for all integers $n \geq 1$ and fixed real-valued parameters $α\geq 0$. We prove new formulas expanding the higher-order derivatives of these LGFs. The results we obtain are combined to express new identities expanding the generalized sum-of-divisors functions. These new identities are expanded in the form of sums of polynomially scaled multiples of a related class of divisor sums depending on $n$ and $α$.
We determine asymptotically the maximal order of log d(d(n)), where d(n) is the number of positive divisors of n. This solves a problem first put forth by Ramanujan in 1915.
We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-γ})^{-1} = 2.280...$ and $γ$ is Euler's constant. We explore several applications and resolve a conjecture of Margenstern about practical numbers.
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 input of the conjectural formula for the classical shifted convolution problem for divisor sums so as to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of length up to $T^2$ with divisor functions as coefficients.
We determine the order of magnitude of H(x,y,z), the number of integers n\le x having a divisor in (y,z], for all x,y and z. We also study H_r(x,y,z), the number of integers n\le x having exactly r divisors in (y,z]. When r=1 we establish the order of magnitude of H_1(x,y,z) for all x,y,z satisfying z\le x^{0.49}. For every r\ge 2, $C>1$ and $ε>0$, we determine the the order of magnitude of H_r(x,y,z) when y is large and y+y/(\log y)^{\log 4 -1 - ε} \le z \le \min(y^{C},x^{1/2-ε}). As a consequence of these bounds, we settle a 1960 conjecture of Erdos and several related conjectures. One key e…
The $j$th divisor function $d_j$, which counts the ordered factorisations of a positive integer into $j$ positive integer factors, is a very well-known arithmetic function; in particular, $d_2(n)$ gives the number of divisors of $n$. However, the $j$th non-trivial divisor function $c_j$, which counts the ordered proper factorisations of a positive integer into $j$ factors, each of which is greater than or equal to 2, is rather less well-studied. We also consider associated divisor functions $c_j^{(r)}$, whose definition is motivated by the sum-over divisors recurrence for $d_j$. After reviewin…
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 representing $n$ as an ordered product of $j+r$ factors, of which the first $j$ must be non-trivial, and their natural extension to negative integers $r.$ We give recurrence properties and explicit formulae for these novel arithmetic functions. Specifically, the functions $c_j^{(-j)}(n)$ count, up to a sign, the number of ordered factorisations of $n$ into $j$ square-…
We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $σ_A(n)= \sum_{d\in A(n)} d$, where A(n) is a subset of the set of all positive divisors of $n$, including the divisor-sum function $σ(n)$ and its unitary and exponential analogues. We also give the minimal order of a new class of Euler-type functions, including the Euler-function $ϕ(n)$ and its unitary analogue.
Let $\ell, m, r$ be fixed positive integers such that $2\nmid \ell$, $3\nmid \ell m$, $\ell>r$ and $3\mid r$. In this paper, using the BHV theorem on the existence of primitive divisors of Lehmer numbers, we prove that if $\min\{r\ell m^2-1,(\ell-r)\ell m^2+1\}>30$, then the equation $(r\ell m^2-1)^x+((\ell -r)\ell m^2+1)^y=(\ell m)^z$ has only the positive integer solution $(x,y,z)=(1,1,2)$.
