Related papers: A new result on the divisor problem in arithmetic …

Iannucci considered the positive divisors of a natural number $n$ that do not exceed the square root of $n$ and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be…

We prove an asymptotic formula for the shifted convolution of the divisor functions $d_k(n)$ and $d(n)$ with $k \geq 4$, which is uniform in the shift parameter and which has a power-saving error term, improving results obtained previously…

We prove that $$ \int_1^X\Delta(x)\Delta_3(x)\,dx \ll X^{13/9}\log^{10/3}X, \quad \int_1^X\Delta(x)\Delta_4(x)\,dx \ll_\varepsilon X^{25/16+\varepsilon}, $$ where $\Delta_k(x)$ is the error term in the asymptotic formula for the summatory…

Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum…

Let $\tau_3(n)$ be the triple divisor function which is the number of solutions of the equation $d_1d_2d_3=n$ in natural numbers. It is shown that $$ \sum_{1\leq n_1,n_2,n_3\leq \sqrt{x}}\tau_3(n_1^2+n_2^2+n_3^2)=c_1x^{\frac{3}{2}}(\log…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…

There have been a plethora of investigations carried out in studying inequalities for the Fourier coefficients of weakly holomorphic modular forms, for example, on the partition function. Recently, Bringmann, Kane, Rolen, and Tripp studied…

The Landau-Selberg-Delange method gives precise asymptotic formulas for the partial sums $\sum_{n \le x} \, a_n$ of a Dirichlet series $\sum_n \, a_n/n^s$ that behaves like a complex power of the Riemann zeta function. However, situations…

We deduce asymptotic formulas for the sums $\sum_{n_1,\ldots,n_r\le x} f(n_1\cdots n_r)$ and $\sum_{n_1,\ldots,n_r\le x} f([n_1\cdots n_r])$, where $r\ge 2$ is a fixed integer, $[n_1,\ldots,n_r]$ stands for the least common multiple of the…

In the late eighties, Hildebrand and Tenenbaum proved an asymptotic formula for the number of positive integers below $x$, having exactly $\nu$ distinct prime divisors: $\pi_{\nu}(x) \sim x \delta_{\nu}(x)$. Here we consider the restricted…

The fastest known algorithm for factoring a degree $n$ univariate polynomial over a finite field $\mathbb{F}_q$ runs in time $O(n^{3/2 + o(1)}\text{polylog } q)$, and there is a reason to believe that the $3/2$ exponent represents a…

Let $d^{(k)}(n)$ be the $k$-free divisor function for integer $k\ge2$. Let $a$ be a nonzero integer. In this paper, we establish an asymptotic formula \begin{equation*} \sum_{p\leq x} d^{(k)}(p-a) =b_k \cdot x+O\left(\frac{x}{\log x}\right)…

We consider solutions of the competitive elliptic system \[ \left\{ \begin{array}{ll} -\Delta u_i = - \sum_{j \neq i} u_i u_j^2 & \text{in $\mathbb{R}^N$} \\ u_i >0 & \text{in $\mathbb{R}^N$} \end{array}\right. \qquad i=1,\dots,k. \] We are…

Let $d(n; r_1, q_1, r_2, q_2)$ be the number of factorization $n=n_1n_2$ satisfying $n_i\equiv r_i\pmod{q_i}$ ($i=1,2$) and $\Delta(x; r_1, q_1, r_2, q_2)$ be the error term of the summatory function of $d(n; r_1, q_1, r_2, q_2)$ with…

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\tau_k$, where $\tau_k$ is a…

In this article, we study the cyclicity problem of elliptic curves $E/\Bbb{Q}$ modulo primes in a given arithmetic progression. We extend the recent work of Akbal and G\"ulo\u{g}lu by proving an unconditional asymptotic for such a cyclicity…

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+\delta}$ which have conveniently sized divisors. The main feature of…

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$.

We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…