The question stem states: Each hole contains at least as many marbles as any hole to the right of it --
Hence consider positions of marbles as P1, P2, P3, P4 and P5, therefore
Let's say that we want to know the minimum number of marbles in the first positions. This means we need to find the maximum number of marbles that are there in any position to the right of the first position. Hence, any number of marbles to the right of the first position will be less than or equal to the number of marbles at the first position.
This implies:
P1[m]>=[\m] Max number of marbles out of (P2,P3,P4,P5)
and
P2[m]>=[\m] Max number of marbles out of (P3,P4,P5)
and
P3[m]>=[\m] Max number of marbles out of (P4,P5)
and
P4[m]>=[\m] Number of marbles in P5
Hence
Marbles in positions P4 and P5 are less than or equal to the number of marbles in P3 but more than one (opposite of the third condition).
Hence, marble in P4 and P5 for the total number of marbles to be minimum is 1 because this always satisfies the third condition stated above, as 3>1.
The second condition states P2 [m]>=[\m]3 and for total number of marbles to be minimum P2 = 3
Similarly for Position 1: P1=3
Hence, the right order is:
3 3 3 1 1 Total : 11 (Answer: D)
Bunuel
Marbles are to be placed in 5 holes in a wall, so that no hole is left unfilled and each hole contains at least as many marbles as any hole to the right of it. If the hole in the middle is to contain 3 marbles, what is the least total number of marbles required?
A. 5
B. 9
C. 10
D. 11
E. 15
Gentle note to all experts and tutors: Please refrain from replying to this question until the Official Answer (OA) is revealed. Let students attempt to solve it first. You are all welcome to contribute posts after the OA is posted. Thank you all for your cooperation!