When the number of divisors is a quadratic residue
Abstract
Let q > 2 be a prime number and define λq := ( τq ) where τ(n) is the number of divisors of n and ( ·q ) is the Legendre symbol. When τ(n) is a quadratic residue modulo q, then ( λq 1 ) (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 λq 1 to the well known average order of τ. The proof reveals that the results depend heavily on the value of ( 2q ). 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.