A system of inequalities describes limits that must hold at the same time. Translate the minimum box count and maximum cookie count, then graph their overlap in Desmos to find the greatest possible whole-number count. The trap is checking only the cookies: an order with too few boxes doesn't qualify.
Hints
- Hint 1
Let count small boxes and count large boxes. The total box count is . How do “at least” and “at most” change the inequality signs for the two limits?
- Hint 2
A large box has more cookies than a small box. Count every box as if it were small, then add the extra cookies for each large box. This makes it easier to use the minimum box count.
- Hint 3
Desmos shades the pairs that satisfy each inequality. Look for the highest point in both shadings with whole-number coordinates, then check whether one more large box would exceed the cookie limit.
Step-by-step
Bound the cookie count, then graph
Step 1Translate the box minimum
Let be the number of small boxes and the number of large boxes. At least boxes means: . Because these are box counts, and must be nonnegative whole numbers.
- Step 2
Translate the cookie maximum
The small boxes contribute cookies, and the large boxes contribute . At most cookies means: . Equality is allowed in both limits.
- Step 3
Show what each large box adds
Find how many more cookies a large box holds: . Count cookies for every box, then add for each large box: . So replacing a small box with a large one adds cookies without changing the box count.
- Step 4
Use the minimum number of boxes
Start with the minimum cookie count for all the boxes, then add the extra cookies for each large box. Since , the rewritten cookie total must satisfy: . Multiply: . The actual total is at most , so any possible order must satisfy: . This bound rules out larger counts; you'll still check that a count at the edge works.
- Step 5
Find and check the greatest count
Type the four inequalities below into Desmos. Their overlap, the region satisfying every limit, reaches its highest point at the intersection ; click it to see the coordinates. That's small and large boxes, or boxes total. The point lies in both shaded regions, so this order meets both limits. The bound above increases with , so no larger count can work either. The maximum is large boxes. Choice C.