arXiv:2303.08391 [math.NT]AbstractReferencesReviewsResources
The asymptotic formulae of sums of two smooth squares for divisor function
Published 2023-03-15Version 1
A natural number $n$ is $y$-smooth if the greatest prime factor of $n$ does not exceed $y$. Let $s_{1}$ and $s_{2}$ are $y$-smooth numbers. We consider sums of smooth squares of the binary Titchmarsh divisor problem and give asymptotic formulae for $\sum_{s_{1}^{2}+s_{2}^{2}\le x}\tau(s_{1}^{2}+s_{2}^{2}+1)$ for $(\log x)^{K}\le y<x^{\frac{1}{2}}$, where $K$ is large enough.
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:1406.6848 [math.NT] (Published 2014-06-26)
Asymptotic formulae for partition ranks
arXiv:1711.02871 [math.NT] (Published 2017-11-08)
On the Number of Connected Components of Ranges of Divisor Functions
arXiv:math/0205136 [math.NT] (Published 2002-05-13)
On the greatest prime factor of (ab+1)(ac+1)