OpenFrontiers
← Back to the index

Will the visible-prime Ulam walk ever visit 571?

TheoremDB P11951 · discrete dynamical systems

Inferred from the community field; finer classification has not been reviewed.

Source catalogue assessmentAs of 2026-09-08Source & evidence ↓

Problem statement

On the standard Ulam spiral, start at the square 11. Repeatedly move to the closest unvisited prime square visible along a primitive lattice direction, breaking distance ties by the smaller prime. Does this walk ever visit the prime square 571571 at coordinates (−6,12)(-6,12)?

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Progress & source assessment

Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.

Open. No signed Lean verification is attached to this problem or its selected resolution.

References
  1. [1]TheoremDB P11951 link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.