Manhattan Prep Official ExplanationA corporate event planner is purchasing gift baskets for an upcoming gala. She will purchase a combination of standard baskets, which cost $30 each, and premium baskets, which cost $50 each. Her total budget for the gift baskets is exactly $1,100, all of which must be spent on these two items. To ensure every VIP receives a basket without overstocking the display tables, the total number of baskets purchased (standard and premium combined) must be at least 25 but no more than 30.
In the table below, identify the Minimum possible number of premium baskets the planner could purchase, and the Maximum possible number of premium baskets the planner could purchase. Make only two selections, one in each column.
Step 1: Understand the Prompt and QuestionGlance at the answers. The integers point to a Quant-based question. Further, the specific costs and total budget provided in the prompt indicate that this is a word problem involving
Linear Equations and integer constraints, since the number of each type of basket must be an integer.
Next, read the entire prompt and jot down the given information on your scratch paper:
Standard: $30
Premium: $50
Total spent = $1,100
Total baskets between 25 and 30, inclusive
Let
S and
P be the number of standard and premium baskets purchased, respectively. Then:
30
S + 50
P = 1,100
25 ≤
S +
P ≤ 30
Finally, read the question stem. The words
minimum possible and
maximum possible indicate that we are looking for boundary values that satisfy all constraints simultaneously.
Step 2: Plan your ApproachNote that the answer choices are relatively small integers, and represent a concrete minimum and maximum value for the number of premium baskets, indicating that
Working Backwards is a viable strategy. To find the maximum value, plan to test the largest answer first and work down from there to identify the largest value that meets the constraints of the problem; to find the minimum value instead, start with the smallest answer and work up.
Another approach is to solve
Algebraically by simultaneously manipulating the linear equation describing the total cost and the inequality representing the constraints on the total number of baskets.
A third approach uses
Logic: by recognizing that three premium baskets cost exactly as much as five standard baskets, it is possible to generate all valid budget combinations systematically and display them in a table, then apply the total-number constraint to identify the minimum and maximum.
Step 3: Solve the ProblemFirst, simplify the budget constraint by dividing both sides by 10:
\(\frac{30? + 50?}{10}= \frac{1100}{10} \)
→ 3
S + 5
P = 110
This simplifies the math in both the working backwards and algebraic approaches.
Work BackwardsThe goal is to find the minimum and maximum valid values for
P. Start by testing the extreme values for
P from the answer choices using the simplified budget constraint: 3
S + 5
P = 110.
Test
P = 22 (the largest answer choice):
3
S + 5(22) = 110
3
S + 110 = 110
3
S = 0
S = 0
The total number of baskets is 0 + 22 = 22. This violates the rule that there must be at least 25 baskets.
Test
P = 20:
3S + 5(20) = 110
3
S = 10
S = 10/3
Since the planner cannot buy a fraction of a basket, this is invalid.
Test
P = 16:
If 3
S + 5(16) = 110
3
S = 30
S = 10
The total number of baskets is 10 + 16 = 26. This satisfies the 25 to 30 total-basket constraint. The
Maximum possible value is 16.
Now find the minimum. Test
P = 1 (the smallest answer choice):
3
S + 5(1) = 110
3
S = 105
S = 35
The total number of baskets is 35 + 1 = 36. This violates the rule that there can be no more than 30 baskets.
Test
P = 10:
3
S + 5(10) = 110
3
S = 60
S = 20
The total number of baskets is 20 + 10 = 30. This exactly hits the upper limit of the total-basket constraint. The
Minimum possible value is 10.
The correct answer is
10 for the first column and
16 for the second column.
AlgebraStart with the budget constraint:
3? + 5? = 110
Since the question is asking for values of P, solve for S in terms of P:

Substitute into the total-basket constraint and simplify:
Divide everything by -2, remembering to flip the direction of the inequalities when dividing by a negative.
To satisfy the budget and total-basket constraints, the number of premium baskets must be between 10 and 17.5, inclusive. Among the answer choices, the smallest number in this range is 10 and the largest is 16. Check that these values of P also produce an integer value for S:

The correct answer is
10 for the first column and
16 for the second column.
LogicA key insight is that three premium baskets cost exactly as much as five standard baskets: 3 × $50 = 5 × $30 = $150. Any valid solution can therefore be converted into another by trading 3 premium baskets for 5 standard baskets (or vice versa), while keeping the total cost at exactly $1,100. Since 3 and 5 share no common factors, no smaller integer trade is possible — this is the minimum exchange that maintains the budget.
Start with the maximum possible number of premium baskets. When S = 0, the entire $1,100 budget goes to premium baskets: $1,100 / $50 = 22. From there, trade 3 premium for 5 standard repeatedly to generate valid budget combinations:


Consider the total-number constraint. Only the rows with 16, 13, or 10 premium baskets result in a total number of baskets between 25 and 30, inclusive. The
Minimum number of premium baskets is 10 and the
Maximum number is 16.
The correct answer is
10 for the first column and
16 for the second column.
Attachment:
GMAT-Club-Forum-8l43gpsh.png [ 10.23 KiB | Viewed 1710 times ]
Attachment:
GMAT-Club-Forum-uhi1ykq2.png [ 3.74 KiB | Viewed 1491 times ]
Attachment:
GMAT-Club-Forum-bd52gn13.png [ 19.64 KiB | Viewed 1489 times ]
Attachment:
GMAT-Club-Forum-fctyvtg1.png [ 1.56 KiB | Viewed 1480 times ]
Attachment:
GMAT-Club-Forum-zrc33iba.png [ 13.14 KiB | Viewed 1467 times ]
Attachment:
GMAT-Club-Forum-u16jl59e.png [ 8.84 KiB | Viewed 1445 times ]
Attachment:
GMAT-Club-Forum-pmfspls5.png [ 5.69 KiB | Viewed 1440 times ]