When the number of divisors is a quadratic residue

arXiv1701.02286MaRDI QIDQ6281709FDOQ6281709

Authors: Olivier Bordellès 

Publication date: 9 January 2017

Abstract: Let $q>2$ be a prime number and define $lambd{a}_q:=left(fracauqight)$ where $au(n)$ is the number of divisors of $n$ and $left(fraccdotqight)$ is the Legendre symbol. When $au(n)$ is a quadratic residue modulo $q$, then $left(lambd{a}_{q}starmathbf1ight)(n)$ could be close to the number of divisors of $n$. This is the aim of this work to compare the mean value of the function $lambd{a}_{q}starmathbf1$ to the well known average order of $au$. The proof reveals that the results depend heavily on the value of $left(frac2qight)$. A bound for short sums in the case $q=5$ is also given, using profound results from the theory of integer points close to certain smooth curves.

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Asymptotic results on arithmetic functions (11N37) Other Dirichlet series and zeta functions (11M41)

This page was built for publication: When the number of divisors is a quadratic residue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281709)