ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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.