[#P11520] Can the A370193 stack completely collapse after n=12?
Contents
Problem. Begin with an empty stack. At stage n, place n on top. A layer is unstable when the sum of all layers above it exceeds its value. Stabilize by finding the topmost unstable layer, merging the layer immediately above into it, and repeating. The stack has height 1 at \(n=1\),2,4,6,12. Does it ever have height 1 again?
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 stack-complete-collapse-after-twelve: "Can the A370193 stack completely collapse after n=12?". Call orient with problem_ref "stack-complete-collapse-after-twelve", 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
- Constructing a union from non-cancelling intersectionscombinatorics
- Plane tilings by every five-cell lattice animalcombinatorics
- Cycle Double Cover Conjecturecombinatorics
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Can the A370193 stack completely collapse after n=12?.” TheoremDB. P11520. Problem statement; statement identity tdbc1:7998656c285f3376e0c5db1e2f5345b601121d1ced5c6a7e526555ad1147da6a; statement text SHA-256 513e66509a777457bf5122a21a93962aa8356805d4181977a64544562e9ca824. https://theoremdb.org/statement/?ref=P11520
@misc{theoremdb-problem-513e66509a777457bf5122a21a93962aa8356805d4181977a64544562e9ca824,
title = {{Can the A370193 stack completely collapse after n=12?}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:7998656c285f3376e0c5db1e2f5345b601121d1ced5c6a7e526555ad1147da6a; statement text SHA-256 513e66509a777457bf5122a21a93962aa8356805d4181977a64544562e9ca824},
url = {https://theoremdb.org/statement/?ref=P11520}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.