ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be prime. For conditions on gg and hh, let Tg condition,h condition(p)T_{g\,\mathrm{condition},h\,\mathrm{condition}}(p) denote the number of corresponding two-cycle solutions modulo pp, where PR\mathop\mathsf{PR} means primitive root, ANY\mathop\mathsf{ANY} means unrestricted, and ∙\bullet denotes any one of the four conditions used on hh.

Two-cycle counting conjectures. The paper conjectures

Tg PR,h ANY(p)≈2ϕ(p−1),Tg ANY,h ANY(p)≈2(p−1).T_{g\,\mathop\mathsf{PR},h\,\mathop\mathsf{ANY}}(p)\approx 2\phi(p-1),\qquad T_{g\,\mathop\mathsf{ANY},h\,\mathop\mathsf{ANY}}(p)\approx 2(p-1).

It further conjectures

Tg RP,h ∙(p)≈[ϕ(p−1)p−1]Tg ANY,h ∙(p),T_{g\,\mathop\mathsf{RP},h\,\bullet}(p)\approx \left[\frac{\phi(p-1)}{p-1}\right]T_{g\,\mathop\mathsf{ANY},h\,\bullet}(p), Tg RPPR,h ∙(p)≈[ϕ(p−1)p−1]Tg PR,h ∙(p).T_{g\,\mathop\mathsf{RPPR},h\,\bullet}(p)\approx \left[\frac{\phi(p-1)}{p-1}\right]T_{g\,\mathop\mathsf{PR},h\,\bullet}(p).

These heuristic formulas concern the predicted numbers of solutions to the discrete-logarithm two-cycle equations under various primitive-root restrictions. The source presents them as conjectural birthday-paradox estimates; no resolution is supplied.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.