Mathematics > Number Theory
[Submitted on 10 Nov 2025]
Title:On the mean square of the error term for the asymmetric two-dimensional divisor problem with congruence conditions
View PDF HTML (experimental)Abstract:Suppose that $a$ and $b$ are positive integers subject to $(a,b)=1$. For $n\in\mathbb{Z}^+$, denote by $\tau_{a,b}(n;\ell_1,M_1,l_2,M_2)$ the asymmetric two--dimensional divisor function with congruence conditions, i.e., \begin{equation*} \tau_{a,b}(n;\ell_1,M_1,l_2,M_2)=\sum_{\substack{n=n_1^an_2^b\\ n_1\equiv\ell_1\!\!\!\!\!\pmod{M_1}\\ n_2\equiv\ell_2\!\!\!\!\!\pmod{M_2}}}1. \end{equation*} In this paper, we shall establish an asymptotic formula of the mean square of the error term of the sum $\sum_{n\leqslant M_1^aM_2^bx}\tau_{a,b}(n;\ell_1,M_1,l_2,M_2)$. This result constitutes an enhancement upon the previous result of Zhai and Cao [16].
References & Citations
export BibTeX citation
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.