A grocer stacks oranges in a pyramid-like stack whose rectangular base is oranges by oranges. Each orange above the first level rests in a pocket formed by four oranges below. The stack is completed by a single row of oranges. How many oranges are in the stack?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Each layer loses one orange in each direction, so the layers are 5x8, 4x7, 3x6, 2x5, 1x4 and the stack stops at the single row of 4.
Solution
An orange sitting in a pocket formed by four oranges lies over the gap between two rows and two columns. So a layer above an rectangle is an rectangle.
Starting from , the layers are
The last layer is a single row of , matching the statement that the stack ends in one row.
Adding the layer sizes:
The answer is .
Why this works
A physical description ("rests in a pocket formed by four oranges") encodes a recursion: both dimensions drop by one per level. Write out the terms explicitly rather than reaching for a formula; the sum has only five terms, and listing them also shows exactly where the stack must stop.
The trap
Stopping the stack at 2x5 or continuing past the 1x4 row, giving 96 or an impossible extra layer.
Common mistakes
- Stopping the stack at 2x5 or continuing past the 1x4 row, giving 96 or an impossible extra layer.
- Assuming each layer shrinks in only one dimension (for instance ).
Techniques
Set up the equation/formula and compute; no special trick needed · Compute small cases, spot the pattern, generalize