document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1119412>Question 1119412</A>: <I><SPAN STYLE=\"word-break: break-all;\"> A single elimination tournament also known as a knockout tournament is one where a loser of a match is automatically eliminated from the tournament. The winner of each round continue to play each other until a single winner is declared. Determine the total number of matches that are necessary for a chess tournament involving 1024 participants  </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #734972 by </B><A HREF=/tutors/aboutme.mpl?userid=greenestamps><B>greenestamps(13200)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=greenestamps><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=greenestamps><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=734972\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <br><BR>\n" );
document.write( "In a single elimination tournament, 1 participant is eliminated each match.  To end up with a single winner in a tournament with n participants, the number of matches required is (n-1).<br><BR>\n" );
document.write( "Answer: 1024-1 = 1023. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );