New Conjectures and Results for Small Cycles of the Discrete Logarithm
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 first author previously extended this question to ask about not only fixed points but also two-cycles, and gave heuristics (building on work of Zhang, Cobeli, Zaharescu, Campbell, and Pomerance) for estimating the number of such pairs given certain conditions on and . In this paper we give a summary of conjectures and results which follow from these heuristics, building again on the aforementioned work. We also make some new conjectures and prove some average versions of the results.
Cite
@article{arxiv.math/0305305,
title = {New Conjectures and Results for Small Cycles of the Discrete Logarithm},
author = {Joshua Holden and Pieter Moree},
journal= {arXiv preprint arXiv:math/0305305},
year = {2007}
}
Comments
10 pages, to appear in the proceedings of the "Conference in Number Theory in Honour of Professor H.C. Williams", 2003. Version 2: Fixed typo in Theorem 1 (missing exponent)