A warehouse has \(n\) widgets to be packed in \(b\) boxes. Each box can hold \(x\) widgets. However, \(n\) is not evenly

[Vincen]

A warehouse has \(n\) widgets to be packed in \(b\) boxes. Each box can hold \(x\) widgets. However, \(n\) is not evenly divisible by \(x,\) so one of the boxes will contain fewer than \(x\) widgets. Which of the following expresses the number of widgets in that box, assuming all other boxes are filled to their capacity of \(x\) widgets?

A. \(n−bx\)

B. \(n−bx+x\)

C. \(n−bx−x\)

D. \(nx−bx\)

E. \(n−x\dfrac{bx}{b−1}\)

[spoiler]OA=B[/spoiler]

Source: Veritas Prep

[Jay@ManhattanReview]

A warehouse has \(n\) widgets to be packed in \(b\) boxes. Each box can hold \(x\) widgets. However, \(n\) is not evenly divisible by \(x,\) so one of the boxes will contain fewer than \(x\) widgets. Which of the following expresses the number of widgets in that box, assuming all other boxes are filled to their capacity of \(x\) widgets?

A. \(n−bx\)

B. \(n−bx+x\)

C. \(n−bx−x\)

D. \(nx−bx\)

E. \(n−x\dfrac{bx}{b−1}\)

[spoiler]OA=B[/spoiler]

Source: Veritas Prep

Given the information, we get that only \(b-1\) boxes would each have \(x\) widgets. Thus, \(b-1\) boxes would have \((b-1)x\) widgets.

No. of widgets left to be placed in the bth or the last box = \(n-(b-1)x=n-bx+x\) widgets.

The correct answer: B

Hope this helps!

-Jay
_________________
Manhattan Review GMAT Prep

Locations: GMAT Classes Albuquerque | GMAT Tutoring | GRE Prep Courses El Paso | Oakland Prep Classes SAT | and many more...

Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.

[Scott@TargetTestPrep]

A warehouse has \(n\) widgets to be packed in \(b\) boxes. Each box can hold \(x\) widgets. However, \(n\) is not evenly divisible by \(x,\) so one of the boxes will contain fewer than \(x\) widgets. Which of the following expresses the number of widgets in that box, assuming all other boxes are filled to their capacity of \(x\) widgets?

A. \(n−bx\)

B. \(n−bx+x\)

C. \(n−bx−x\)

D. \(nx−bx\)

E. \(n−x\dfrac{bx}{b−1}\)

[spoiler]OA=B[/spoiler]

Solution:

We see that b - 1 boxes will be filled with x widgets each, and they together hold x(b - 1) = bx - x widgets. Therefore, the last box, i.e., the partially filled box, will hold n - (bx - x) = n - bx + x widgets.

Answer: B