On a problem of Arnold: the average multiplicative order of a given integer

Original · EN

For g,n coprime integers, let lg(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of lg(n) as n <= x ranges over integers coprime to g, and x tending to infinity. Assuming the Generalized Riemann Hypothesis, we show that this average is essentially as large as the average of the Carmichael lambda function. We also determine the asymptotics of the average of lg(p) as p <= x ranges over primes.