1971 AHSME Problems/Problem 27

Revision as of 18:00, 6 August 2024 by Thepowerful456 (talk | contribs) (see also box)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A box contains chips, each of which is red, white, or blue. The number of blue chips is at least half the number of white chips, and at most one third the number of red chips. The number which are white or blue is at least $55$. The minimum number of red chips is

$\textbf{(A) }24\qquad \textbf{(B) }33\qquad \textbf{(C) }45\qquad \textbf{(D) }54\qquad  \textbf{(E) }57$


Solution

Let the number of white be $2x$. The number of blue is then $x-y$ for some constant $y$. So we want $2x+x-y=55\rightarrow 3x-y=55$. We take mod 3 to find y. $55=1\pmod{3}$, so blue is 1 more than half white. The number of whites is then 36, and the number of blues is 19. So $19*3=\boxed{\textbf{(E) }57}$


~yofro

See Also

1971 AHSC (ProblemsAnswer KeyResources)
Preceded by
Problem 26
Followed by
Problem 28
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 31 32 33 34 35
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