ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a grand zigzag knight's path be a path whose number of steps has an expected value determined by the corresponding family of paths ending on the xx-axis at size nn. Asymptotic expected-length conjecture. An asymptotic approximation for the expected number of steps of a grand zigzag knight's path ending on the xx-axis of size nn is

1+525⋅n.\frac{1+\sqrt{5}}{2\sqrt{5}}\cdot n.

The even-size case is established in the preceding theorem, while the source presents the odd-size analogue as suggested by Mathematica calculations and does not provide a proof.

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.