benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / In this problem only, assume that s₁=4 and that exactly one board square, say square number n, is marked with an arrow. Determine all choices of n that maximize the average distanc…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

In this problem only, assume that s1=4s_{1}=4 and that exactly one board square, say square number nn, is marked with an arrow. Determine all choices of nn that maximize the average distance in squares the first player will travel in his first two turns.
Plain-text mathematical notation (without MathML)
In this problem only, assume that s₁=4 and that exactly one board square, say square number n, is marked with an arrow. Determine all choices of n that maximize the average distance in squares the first player will travel in his first two turns.
Original LaTeX notation
In this problem only, assume that $s_{1}=4$ and that exactly one board square, say square number $n$, is marked with an arrow. Determine all choices of $n$ that maximize the average distance in squares the first player will travel in his first two turns.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
a509f0e7-24cd-556c-ac39-333a2a149fc4
task_key
test--a509f0e7-24cd-556c-ac39-333a2a149fc4
task_revision_id
1
config / split
/ test

Official source

initial import