Two-side estimates of the number of fixed points of a discrete logarithm
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2012), pp. 3-8
Cet article a éte moissonné depuis la source Math-Net.Ru
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$.
@article{VMUMM_2012_3_a0,
author = {E. A. Grechnikov},
title = {Two-side estimates of the number of fixed points of a discrete logarithm},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {3--8},
year = {2012},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2012_3_a0/}
}
E. A. Grechnikov. Two-side estimates of the number of fixed points of a discrete logarithm. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2012), pp. 3-8. http://geodesic.mathdoc.fr/item/VMUMM_2012_3_a0/
[1] Guy R.K., Unsolved problems in number theory, 2nd ed., Springer-Verlag, N.Y.–Berlin, 1994 | MR
[2] Campbell M.E., On fixed points for discrete logarithms, Master's thesis, University of California at Berkeley, 2003 http://math.berkeley.edu/c̃ampbell/marithesis.pdf
[3] Konyagin S.V., Shparlinski I.E., Character sums with exponential functions and their applications, Cambridge University Press, Cambridge, 1999 | MR
[4] Ramanujan S., “Highly composite numbers. Annotated and with a foreword by Nicolas J.-L. and Robin G.”, Ramanujan J., 1:2 (1997), 119–153 | DOI | MR