English
Related papers

Related papers: A binary quadratic Titchmarsh divisor problem

200 papers

We prove an asymptotic formula for primes of the shape $f(a,b^2)$ with $a,b$ integers and of the shape $f(a,p^2)$ with $p$ prime. Here $f$ is a binary quadratic form with integer coefficients, irreducible over $\mathbb{Q}$ and has no local…

Number Theory · Mathematics 2024-09-25 Stanley Yao Xiao

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…

Number Theory · Mathematics 2017-05-19 Nathan Ng , Mark Thom

We obtain several asymptotic estimates for the sums of the restricted divisor function $$ \tau_{M,N}(k) = #\{1 \le m \le M, \ 1\le n \le N: mn = k\} $$ over short arithmetic progressions, which improve some results of J. Truelsen. Such…

Number Theory · Mathematics 2010-08-05 Igor E. Shparlinski

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

Number Theory · Mathematics 2022-01-19 Stephan Baier , Anup Haldar

For a fixed natural number $h$, we prove meromorphic continuation of the two-variable Dirichlet series $\sum_m r_2(m) \sigma_w(m + h) (m + h)^{-s + w}$ to $\mathbb{C}^2$ and use this to obtain asymptotics for $\sum_{m^2 + n^2 \leq X}…

Number Theory · Mathematics 2023-10-23 Chan Ieong Kuan , David Lowry-Duda , Alexander Walker , Tinghao Huang

We prove an asymptotic formula for the sum $\sum_{n \leq N} d(n^2 - 1)$, where $d(n)$ denotes the number of divisors of $n$. During the course of our proof, we also furnish an asymptotic formula for the sum $\sum_{d \leq N} g(d)$, where…

Number Theory · Mathematics 2019-02-20 Adrian Dudek

We prove that $$ \sum_{p \leq x} \frac{1}{\tau(p-1)} \asymp \frac{x}{(\log x)^{3/2}}, \quad \quad \sum_{n \leq x} \frac{1}{\tau(n^2+1)} \asymp \frac{x}{(\log x)^{1/2}}, $$ where $\tau(n)=\sum_{d|n}1$ is the number of divisors of $n$, and…

Number Theory · Mathematics 2023-04-12 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Sergei V. Konyagin

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+m^n=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the…

Number Theory · Mathematics 2025-10-08 Firuz Rakhmonov

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;…

Number Theory · Mathematics 2019-09-18 Kostadinka Lapkova , Nian Hong Zhou

Let $q > 2$ be a prime number and define $\lambda_q := \left( \frac{\tau}{q} \right)$ where $\tau(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $\tau(n)$ is a quadratic residue modulo…

Number Theory · Mathematics 2017-01-10 Olivier Bordellès

The binary problem of Goldbach is solved by the method of the trigonometrical sums. The asymptotic formula of distribution of the even numbers formed by the sum of two simple uneven numbers is found for each even number from the set of…

General Mathematics · Mathematics 2015-06-02 S. V. Matnyak

We study a mean value of the classical additive divisor problem. The main term we are interested in here is the one by Motohashi, but we also give an upper bound for the case where the main term is that of Atkinson. Furthermore, we point…

Number Theory · Mathematics 2012-02-06 Eeva Suvitie

We study the average value of the divisor function $\tau(n)$ for $n\le x$ with $n \equiv a \bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$.…

Number Theory · Mathematics 2016-05-25 Rizwanur Khan

In a recent paper, Lapkova uses a Tauberian theorem to derive the asymptotic formula for the divisor sum $\sum_{n \leq x} d( n (n+v))$ where $v$ is a fixed integer and $d(n)$ denotes the number of divisors of $n$. We reprove her result by…

Number Theory · Mathematics 2019-02-20 Adrian W. Dudek , Łukasz Pańkowski , Victor Scharaschkin

In this paper we generalize the result of Fouvry and Iwaniec dealing with prime values of the quadratic form $x^2 + y^2$ with one input restricted to a thin subset of the integers. We prove the same result with an arbitrary primitive…

Number Theory · Mathematics 2020-05-27 Peter Cho-Ho Lam , Damaris Schindler , Stanley Yao Xiao

Sarnak obtained the asymptotic formula of the sum of the class numbers of indefinite binary quadratic forms from the prime geodesic theorem for the modular group. In the present paper, we show several asymptotic formulas of partial sums of…

Number Theory · Mathematics 2015-02-10 Yasufumi Hashimoto

We investigate the average order of the divisor function at values of totally reducible binary cubic forms and discuss some applications.

Number Theory · Mathematics 2010-11-11 T. D. Browning

By simple elementary method,we obtain with ease,a highly simple expression for the remainder term of the divisor problem and use it to obtain an Euler-Maclaurin analogue of summation involving divisor function.We also obtain a relation…

Number Theory · Mathematics 2008-09-13 Vivek V. Rane

We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…

Number Theory · Mathematics 2022-11-23 Kevin Smith , Julio Andrade

For an irrational $\alpha\in \mathbb{R}$, we consider additive problems with the set of primes satisfying $\lVert\alpha p\rVert\leq \frac{1}{p^\tau}$ for some fixed $\tau>0$. In particular, we show that there exist infinitely many…

Number Theory · Mathematics 2025-08-19 Sarvagya Jain