benchmarks.wiki / Public workspace

MATH / Three different one-digit positive integers are placed in the bottom row of…

Problem

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

problem

Three different one-digit positive integers are placed in the bottom row of cells. Numbers in adjacent cells are added and the sum is placed in the cell above them. In the second row, continue the same process to obtain a number in the top cell. What is the difference between the largest and smallest numbers possible in the top cell? [asy]
path box=(0,0)--(1,0)--(1,1)--(0,1)--cycle;
draw(box);
draw(shift(1.5,0)*box);
draw(shift(3,0)*box);
draw(shift(.75,2)*box);
draw(shift(2.25,2)*box);
draw(shift(1.5,4)*box);
picture p;
draw(p, (.6,.2)--(.95, .8), EndArrow);
draw(p, (1.9,.2)--(1.55, .8), EndArrow);
draw(p, (1.25, .8)--(1.25,.6));
draw(p, (1.15, .7)--(1.35,.7));
add(shift(0,1)*p);
add(shift(1.5,1)*p);
add(shift(.75,3)*p);
[/asy]

level

Level 3

type

Counting & Probability

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

Official source

initial import