Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
What is the shortest curve guaranteed to reach the boundary of the golden gnomon - the isosceles triangle with equal sides $1$ and apex angle $108^\circ$ - from an unknown starting position and heading? The optimum is a symmetric seven-piece path of segments, circular shoulders and tangents, of exactly determined transcendental length $C = 1.282676\ldots$ - the first proved exact optimum for an isosceles triangle with base angle below $45^\circ$.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
The models were used throughout: to search out the extremal curve, to draft the arguments, and to write the accompanying Lean 4 development. The paper states precisely which steps are machine-checked, and notes those checks hold regardless of how the statements were found.
Provider: Anthropic / OpenAI · Prompt public: unknown · Independence: unknown
Lean 4 verifies the two finite algebraic certificate families and the discrete ledger identities, but not the full argument end to end; the paper's appendix states exactly which steps are machine-checked. arXiv preprint, not yet peer-reviewed.
Correctness: unknown · statement fidelity: unaudited · peer review: none
Bellman's problem for general regions remains open
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.