1976 AHSME Problems/Problem 12

Revision as of 10:28, 20 April 2021 by Jiang147369 (talk | contribs) (Created page with "== Problem 12 == A supermarket has <math>128</math> crates of apples. Each crate contains at least <math>120</math> apples and at most <math>144</math> apples. What is the l...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem 12

A supermarket has $128$ crates of apples. Each crate contains at least $120$ apples and at most $144$ apples. What is the largest integer $n$ such that there must be at least $n$ crates containing the same number of apples?

$\textbf{(A) }4\qquad \textbf{(B) }5\qquad \textbf{(C) }6\qquad \textbf{(D) }24\qquad  \textbf{(E) }25$

Solution

To find the largest number of "repeated" crates necessary, we must account for all the possibilities of the number of apples in each crate. Since each crate contains a minimum of $120$ apples and a maximum of $144$ apples, there are $144 - 120 + 1 = 25$ different amounts possible for the number of apples per crate.

Now, we have to count for the worst case scenario: the $25$ amounts are repeated as many times as possible.

$25$ can go into $128$ exactly $5$ times because $5 \cdot 25 = 125$, which is less than $128$. This leaves a remainder of $3$ crates.

The worst case scenario would be that these $3$ crates have a different number of apples each. It doesn't actually matter how many apples are in these $3$ crates because any of the $25$ values would be repeated again anyway. So, the answer is $5 + 1 = \boxed{\textbf{(C) }6}$ ~jiang147369

See Also

1976 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 11
Followed by
Problem 13
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png