Auxiliary solution-count conjectures for the discrete logarithm equation
Auxiliary solution-count conjectures for the discrete logarithm equation
Let be prime. For the auxiliary equation studied in the paper, let denote the number of solutions with the indicated restrictions, and let be Euler's totient function. If is squarefree, write its prime divisors as ; in general write when is the exact power of dividing .
Auxiliary solution-count conjectures.
If is squarefree, then
In general,
The product is over primes dividing . Additionally,
These predictions are derived from the paper's random-map heuristic for and remain conjectural in the supplied text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Joshua Holden and Pieter Moree, “Some Heuristics and Results for Small Cycles of the Discrete Logarithm”, arXiv:math/0401013 (2004).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.