benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / The integers 1,2,4,5,6,9,10,11,13 are to be placed in the circles and squares below with one number in each shape. Each integer must be used exactly once and the integer in each ci…

Problem

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

problem

The integers 1,2,4,5,6,9,10,11,131,2,4,5,6,9,10,11,13 are to be placed in the circles and squares below with one number in each shape. Each integer must be used exactly once and the integer in each circle must be equal to the sum of the integers in the two neighbouring squares. If the integer xx is placed in the leftmost square and the integer yy is placed in the rightmost square, what is the largest possible value of x+yx+y?
Plain-text mathematical notation (without MathML)
The integers 1,2,4,5,6,9,10,11,13 are to be placed in the circles and squares below with one number in each shape. Each integer must be used exactly once and the integer in each circle must be equal to the sum of the integers in the two neighbouring squares. If the integer x is placed in the leftmost square and the integer y is placed in the rightmost square, what is the largest possible value of x+y?
Original LaTeX notation
The integers $1,2,4,5,6,9,10,11,13$ are to be placed in the circles and squares below with one number in each shape. Each integer must be used exactly once and the integer in each circle must be equal to the sum of the integers in the two neighbouring squares. If the integer $x$ is placed in the leftmost square and the integer $y$ is placed in the rightmost square, what is the largest possible value of $x+y$?

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
74607ee2-1936-5f21-9ece-5d4d70bcf48c
task_key
test--74607ee2-1936-5f21-9ece-5d4d70bcf48c
task_revision_id
1
config / split
/ test

Official source

initial import