# Difference between revisions of "1971 AHSME Problems/Problem 27"

(Solution) |
(→Solution) |
||

(One intermediate revision by the same user not shown) | |||

Line 1: | Line 1: | ||

+ | ==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 <math>55</math>. The minimum number of red chips is | ||

+ | |||

+ | <math>\textbf{(A) }24\qquad \textbf{(B) }33\qquad \textbf{(C) }45\qquad \textbf{(D) }54\qquad \textbf{(E) }57</math> | ||

+ | |||

+ | |||

==Solution== | ==Solution== | ||

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

+ | |||

+ | |||

+ | ~yofro |

## Latest revision as of 22:14, 15 September 2020

## 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 . The minimum number of red chips is

## Solution

Let the number of white be . The number of blue is then for some constant . So we want . We take mod 3 to find y. , so blue is 1 more than half white. The number of whites is then 36, and the number of blues is 19. So

~yofro