← All problems

Infinitely many loops in the Euclid-Mullin graph

11 years old · traced to

Let G1G_1 be the Euclid–Mullin graph associated with the initial node 11, whose edges and loops are defined by the graph construction in the paper. Infinitely many loops conjecture. The graph G1G_1 contains infinitely many loops. This is motivated by a heuristic that nodes on the right-most branch become equidistributed among invertible residue classes modulo a fixed modulus; the conjecture remains open.

References
  1. Andrew R. Booker and Sean A. Irvine, “The Euclid-Mullin graph”, arXiv:1508.03039 (2016).

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.