On the Order of aa modulo nn on Average

preprint2016arXivOpen access

Abstract

Let a>1a>1 be an integer. Denote by la(n)l_a(n) the multiplicative order of aa modulo integer n≥1n\geq 1. We prove that there is a positive constant δδ such that if x1−δlog⁡3x=o(y)x^{1-δ}\log^3 x = o(y), then 1y∑a<y1x∑a<n<x(a,n)=1la(n)=xlog⁡xexp⁡(Blog⁡log⁡xlog⁡log⁡log⁡x(1+o(1))) \frac1y \sum_{a<y} \frac1x \sum_{\substack{{a<n<x}\\{(a,n)=1}}}l_a(n) = \frac x{\log x}\exp \left(B\frac{\log\log x}{\log\log\log x}(1+o(1))\right) where B=e−γ∏p(1−1(p−1)2(p+1)). B=e^{-γ}\prod_p \left(1-\frac 1{(p-1)^2(p+1)}\right). This is an improvement over a statement in Kurlberg and Pomerance (see ~\cite{KP}): 1x2∑a<x∑a<n<xla(n)=xlog⁡xexp⁡(Blog⁡log⁡xlog⁡log⁡log⁡x(1+o(1))).\frac{1}{x^2} \sum_{a<x} \sum_{a<n<x} l_a(n) = \frac x{\log x} \exp \left(B \frac{\log\log x} {\log\log\log x} (1+o(1)) \right).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.