ArcXiv

Average Results on the Order of a modulo p

Abstract

Let a>1 be an integer. Denote by la(p) the multiplicative order of a modulo primes p. We prove that if x x x=o(y), then 1 y Σa≤ yΣp≤ x1la(p)= x + C x+O( x y x) which is an improvement over a theorem by Felix ~Fe. Additionally, we also prove two other average results If 2 x = o((x)) and x1-δ3 x = o(y), then 1y Σa<y Σp<x \\ la(p)>x(x) 1 = π(x) + O(x x(x)) + O(x2 - δ2 xy). Furthermore, if x1-δ3 x = o(y), then 1yΣa<y Σp<x \\ p ala(p) = cLi(x2) + O( x2A x ) + O(x3 -δ2 xy) where c = Πp (1- pp3-1).

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…