Average-order conjecture for arbitrary two-cycle counts
Average-order conjecture for arbitrary two-cycle counts
Let range over primes, let be the number of solutions of the two-cycle equation with and unrestricted, and let denote the logarithmic integral. For any fixed , write for a bound whose implied constant may depend on .
Average two-cycle conjecture. For every ,
This conjecture is motivated by a numerical average for an auxiliary arithmetic function and predicts an asymptotic formula for the prime average of the unrestricted two-cycle count. The source explicitly describes the assertion as conjectural and gives no proof or resolution.
Sources & referencesView supporting material
Primary source
Joshua Holden and Pieter Moree, “New Conjectures and Results for Small Cycles of the Discrete Logarithm”, arXiv:math/0305305 (2003).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.