Distribution of the Error in Estimated Numbers of Fixed Points of the Discrete Logarithm
Joshua Holden
Abstract
Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The author and Pieter Moree, building on work of Zhang, Cobeli, and Zaharescu, gave heuristics for estimating the number of such pairs and proved bounds on the error in the estimates. These bounds are not descriptive of the true situation, however, and this paper is a first attempt to collect and analyze some data on the distribution of the actual error in the estimates.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan