Related papers: Karatsuba's divisor problem and related questions

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

In this paper, we derive the following asymptotic formula $$ \mathop{{\sum}'}_{n\leqslant x}\dfrac{r(n)}{r(n+1)} = {x}{(\ln x)^{-3/4}}(c+o(1)),\ \ x \to +\infty,$$ where $r(n)$ is the number of representations of $n$ as a sum of two…

We have proved that $\triangle(X)=X^{1/4+\epsilon(X)}$, $\epsilon(X)=\frac{c}{\log\log X}$.

Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + \epsilon}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-\epsilon}$. We show there exists a subset…

Let $f$ be a Steinhaus random multiplicative function, and for $\alpha\in \mathbb{R}$, let $d_\alpha$ denote the $\alpha$-divisor function. For $\alpha \in (1,2)$ we establish that $$ \mathbb{E}\bigg\{\Big|\frac{1}{\sqrt{x}}\sum_{n\leq x}…

Additive divisor sums play a prominent role in the theory of the moments of the Riemann zeta function. There is a long history of determining sharp asymptotic formula for the shifted convolution sum of the ordinary divisor function. In…

Let $b > a > 0$. We prove the following asymptotic formula $$\sum_{n\ge 0} \big\lvert\{x/(n+a)\} - \{x/(n+b)\}\big\rvert = \frac{2}{\pi}\zeta(3/2)\sqrt{cx} + O(c^{2/9}x^{4/9}),$$ with $c=b-a$, uniformly for $x \ge 40 c^{-5}(1+b)^{27/2}$.

Let $\omega^*(n)$ be the number of primes $p$ such that $p-1$ divides $n$. Recently, R. M. Murty and V. K. Murty proved that $$x(\log\log x)^3\ll\sum_{n\le x}\omega^*(n)^2\ll x\log x.$$ They further conjectured that there is some positive…

Let $F({\bf x})\in\mathbb{Z}[x_1,x_2,\dots,x_n]$ be a quadratic polynomial in $n\geq 3$ variables with a nonsingular quadratic part. Using the circle method we derive an asymptotic formula for the sum $$ \Sigma_{k,F}(X;…

We consider the problem of sums of dilates in groups of prime order. We show that given $A\subset \Z{p}$ of sufficiently small density then $$\big| \lambda_{1}A+\lambda_{2}A+...+ \lambda_{k}A \big|…

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

Consider the real numbers $$ \ell_{n,k} = \ln\left( \tfrac{3}{2}\,k+\sqrt{\left(\tfrac{3}{2}\,k \right)^2 + 3\,n} \right) $$ and the intervals $\mathcal{L}_{n,k} = \left]\ell_{n,k}-\ln 3,\ell_{n,k}\right]$. For all $n \geq 1$, define $$…

Let $\omega^*(n)$ be the number of primes $p$ such that $p-1$ divides $n$. Assuming the Elliott--Halberstam Conjecture, we prove a conjecture posted by M. R. Murty and V. K. Murty in 2021 which states that $$\sum_{n\leqslant…

In this paper, we obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…

Let $f(n)$ be a random completely multiplicative function such that $f(p) = \pm 1$ with probabilities $1/2$ independently at each prime. We study the conditional probability, given that $f(p) = 1$ for all $p < y$, that all partial sums of…

In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…

We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x(log x)^{-1+o(1)} numbers not exceeding x common to the ranges of Euler's function phi(n) and the sum-of-divisors function sigma(m).

For $\mu>0$ we study an asymptotic behavior of the sequence defined as $$T_{n}(\mu)=\frac{max_{1\leq m \leq {n^{\frac{1}{\mu}}}}\{\tau (n + m)\}}{\tau(n)},\ n=1,2,...$$ where $\tau(n)$ denotes the number of natural divisors of the given…

We study the triple convolution sum of the divisor function given by $$\sum_{n\leq x} d(n)d(n-h)d(n+h)$$ for $h\neq 0$ and $d(n)$ denotes the number of positive divisors of $n$. Based on algebraic and geometric considerations, Browning…