Average-order conjecture for arbitrary two-cycle counts

About 23 years old · traced to

Let pp range over primes, let Ch ANY,a ANY(p)C_{h\,\mathop\mathsf{ANY},a\,\mathop\mathsf{ANY}}(p) be the number of solutions of the two-cycle equation with hh and aa unrestricted, and let Li⁡(x)\operatorname{Li}(x) denote the logarithmic integral. For any fixed C>0C>0, write OC(⋅)O_C(\cdot) for a bound whose implied constant may depend on CC.

Average two-cycle conjecture. For every C>0C>0,

∑p≤xCh ANY,a ANY(p)p−1=2.644⋯Li⁡(x)+OC(xlog⁡Cx).\sum_{p\leq x}\frac{C_{h\,\mathop\mathsf{ANY},a\,\mathop\mathsf{ANY}}(p)}{p-1}=2.644\cdots\operatorname{Li}(x)+O_C\left(\frac{x}{\log^C x}\right).

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.

References

Primary source

Joshua Holden and Pieter Moree, “New Conjectures and Results for Small Cycles of the Discrete Logarithm”, arXiv:math/0305305 (2003).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.