document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1210235>Question 1210235</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Let S be a set of distinct integers.  What is the smallest number of elements that S must contain, to ensure that S has a nonempty subset, where the sum of the elements in the subset is divisible by 2? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #851717 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=851717\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <br><BR>\n" );
document.write( "Suppose the set S is {N}, where N is an even integer.<br><BR>\n" );
document.write( "The nonempty set {N} is a subset of the given set S, and the sum of the elements of that nonempty subset is divisible by 2.<br><BR>\n" );
document.write( "So the set {N} satisfies all the conditions; so the smallest number of elements a set must contain to satisfy the conditions is 1.<br><BR>\n" );
document.write( "ANSWER: 1<br><BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );