Mathematics of Computation · 2005 · 25 citations · 7 references
Natural SciencesComputer ScienceMathematicsAlgorithmsDiscrete MathematicsNumber TheoryComputational Number TheoryNumber-theoretic AlgorithmsDiscrete Logarithm AlgorithmsDiscrete Logarithm Problem
Brizolis asked the question: does every prime <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p"> <mml:semantics> <mml:mi>p</mml:mi> <mml:annotation encoding="application/x-tex">p</mml:annotation> </mml:semantics> </mml:math> </inline-formula> have a pair <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="left-parenthesis g comma h right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>g</mml:mi> <mml:mo>,</mml:mo> <mml:mi>h</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">(g,h)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> such that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="h"> <mml:semantics> <mml:mi>h</mml:mi> <mml:annotation encoding="application/x-tex">h</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a fixed point for the discrete logarithm with base <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="g"> <mml:semantics> <mml:mi>g</mml:mi> <mml:annotation encoding="application/x-tex">g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ? 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 <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="g"> <mml:semantics> <mml:mi>g</mml:mi> <mml:annotation encoding="application/x-tex">g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="h"> <mml:semantics> <mml:mi>h</mml:mi> <mml:annotation encoding="application/x-tex">h</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . In this paper we extend these heuristics and prove results for some of them, building again on the aforementioned work. We also make some new conjectures and prove some average versions of the results.
7
Approximation of singular series and automata
Pieter Moree · manuscripta mathematica · 2000 · 52 citations
An average result for Artin's conjecture
P. J. Stephens · Mathematika · 1969 · 37 citations
A Two-Variable Artin Conjecture
Pieter Moree, Peter Stevenhagen · Journal of Number Theory · 2000 · 30 citations