This article is cited in 1 paper

Mathematics

Two-side estimates of the number of fixed points of a discrete logarithm

E. A. Grechnikov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: Lower and upper bounds are obtained for an average number of solutions of the congruence $g^x\equiv x\pmod p$ in nonnegative integer numbers $x\le p-1$, where $g$ is a primitive root modulo $p$.

Key words: discrete logarithm, Brizolis problem.

UDC: 511

Received: 11.08.2010

 English version: Moscow University Mathematics Bulletin, Moscow University Mеchanics Bulletin, 2012, 67:3, 91–96

Bibliographic databases:

• 
• 
•