Or search by topic
Five integers (whole numbers) are placed on the bottom row of this pyramid. They must satisfy the following conditions:
Each number in the upper rows of the pyramid is formed by combining the two numbers below it, according to the following rules:
Try starting with $4, 6, 1, 7, 2$ on the bottom row. What do you get at the top?
What is the largest top number you can obtain?
Extension:
What is the largest top number you can obtain if zeroes are allowed?
What is the largest top number you can obtain if negative numbers are allowed?
With thanks to Don Steward, whose ideas formed the basis of this problem.