document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=397124>Question 397124</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Hello,<BR>\n" );
document.write( "I have this math brain teaser that is killing me.  Can you help please?\r<BR>\n" );
document.write( "\n" );
document.write( "In a dark room, a boxed is filled with different colored balls there are 14 blue, 13 red, 22 black and 18 green. What is the smallest number of balls you need to select to get at least 4 of the same color.\r<BR>\n" );
document.write( "\n" );
document.write( "Kindest regards,<BR>\n" );
document.write( "Candy </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #281520 by </B><A HREF=/tutors/aboutme.mpl?userid=richard1234><B>richard1234(7193)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=richard1234><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=richard1234><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=281520\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Note that the Pigeonhole Principle says that if there if we have kn + 1 pigeons distributed into n holes, then there is at least one hole with k+1 pigeons. In this case, n = 4 (there are four colors, or \"holes\"), and we want to guarantee that one of these \"holes\" has four \"pigeons.\" Therefore, letting k = 3, we see that if we draw 3(4) + 1 or 13 balls, we are guaranteed to have four of the same color.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "If there are 12 balls, then it is possible to draw three of each color. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );