[#P11951] Will the visible-prime Ulam walk ever visit 571?
Contents
Problem. On the standard Ulam spiral, start at the square \(1\). 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 \(571\) at coordinates \((-6,12)\)?
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research will-the-visible-prime-ulam-walk-ever-visit-571: "Will the visible-prime Ulam walk ever visit 571?". Call orient with problem_ref "will-the-visible-prime-ulam-walk-ever-visit-571", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
- Merging of orbits under adding the product of nonzero digitsdiscrete dynamical systems
- Collatz conjecturediscrete dynamical systems
- Integer return under the 4/3 ceiling mapdiscrete dynamical systems
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Will the visible-prime Ulam walk ever visit 571?.” TheoremDB. P11951. Problem statement; statement identity tdbc1:f9563fc065569e355dfa2232faa923ae7c698209dd4a541e999f9546c6631d7b; statement text SHA-256 af9a37158e4c90cacdc7a479ce7652cf897b79d140bb09cf4fd1d404a852b576. https://theoremdb.org/statement/?ref=P11951
@misc{theoremdb-problem-af9a37158e4c90cacdc7a479ce7652cf897b79d140bb09cf4fd1d404a852b576,
title = {{Will the visible-prime Ulam walk ever visit 571?}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:f9563fc065569e355dfa2232faa923ae7c698209dd4a541e999f9546c6631d7b; statement text SHA-256 af9a37158e4c90cacdc7a479ce7652cf897b79d140bb09cf4fd1d404a852b576},
url = {https://theoremdb.org/statement/?ref=P11951}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.