benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / The integers 1,2,…,64 are written in the squares of a 8×8 chess board, such that for each 1≤i<64, the numbers i and i+1 are in squares that share an edge. What is the largest possi…

Problem

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

problem

The integers 1,2,…,641,2, \ldots, 64 are written in the squares of a 8×88 \times 8 chess board, such that for each 1≤i<641 \leq i<64, the numbers ii and i+1i+1 are in squares that share an edge. What is the largest possible sum that can appear along one of the diagonals?
Plain-text mathematical notation (without MathML)
The integers 1,2,…,64 are written in the squares of a 8×8 chess board, such that for each 1≤i<64, the numbers i and i+1 are in squares that share an edge. What is the largest possible sum that can appear along one of the diagonals?
Original LaTeX notation
The integers $1,2, \ldots, 64$ are written in the squares of a $8 \times 8$ chess board, such that for each $1 \leq i<64$, the numbers $i$ and $i+1$ are in squares that share an edge. What is the largest possible sum that can appear along one of the diagonals?

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
0bac05e3-6b3f-550b-8321-1cc64c6bb590
task_key
test--0bac05e3-6b3f-550b-8321-1cc64c6bb590
task_revision_id
1
config / split
/ test

Official source

initial import