Bunuel
A number of eggs dyed various colors were hidden for an egg hunt. How many eggs in total were hidden?
(1) The number of red eggs hidden is the square of an integer, while the total number of eggs hidden is 24 times that integer.
(2) Exactly 143 of the eggs hidden were not red.
\({\rm{Total}}\,\,\left\{ \matrix{\\
\,{\rm{red}}\,\,:\,\,\,R \ge 1\,\,{\mathop{\rm int}} \hfill \cr \\
\,{\rm{not - red}}\,\,:\,\,\,N \ge 1\,\,{\mathop{\rm int}} \hfill \cr} \right.\)
\(? = R + N\)
Let´s go straight to (1+2): a
BIFURCATION will prove the correct answer is (E).
\(\left( {1 + 2} \right)\,\,\left\{ \matrix{\\
N = 143 \hfill \cr \\
R = {M^2}\,\,,\,\,R + N = 24M\,\,\,\,\left( {M \ge 1\,\,{\mathop{\rm int}} } \right)\,\,\,\left( * \right) \hfill \cr} \right.\)
\(\left( * \right)\,\,\, \Rightarrow \,\,\,N = 24M - {M^2} \Rightarrow \,\,\,\,11 \cdot 13 = 143 = M\left( {24 - M} \right)\,\,\,\, \Rightarrow \,\,\,M = 11\,\,{\rm{or}}\,\,M = 13\)
\(\left\{ \matrix{\\
\,M = 11\,\,\,\,\, \Rightarrow \,\,\,\,\,R = {11^2}\,\,\,\,\, \Rightarrow \,\,\,\,\,? = {11^2} + 143 \hfill \cr \\
\,M = 13\,\,\,\,\, \Rightarrow \,\,\,\,\,R = {13^2}\,\,\,\,\, \Rightarrow \,\,\,\,\,? = {13^2} + 143 \hfill \cr} \right.\)
This solution follows the notations and rationale taught in the GMATH method.
Regards,
Fabio.