document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1196020>Question 1196020</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Let  n∈N. Since  ≡n is an equivalence relation on Z. The set of  ≡n equivalence classes forms a partition of Z. How many sets are in this partition?\r<BR>\n" );
document.write( "\n" );
document.write( "Please explain. I don't understand how to calculate how many sets are in a partition.  <BR>\n" );
document.write( "I think it could be n ?\r<BR>\n" );
document.write( "\n" );
document.write( "Thank you. </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #828685 by </B><A HREF=/tutors/aboutme.mpl?userid=ikleyn><B>ikleyn(52874)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=ikleyn><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=ikleyn><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=828685\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> .\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "One set is all numbers n∈N that are multiple of n (give the remainder 0 when divided by n).\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Second set is all numbers n∈N that give the remainder 1 when divided by n.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Third set is all numbers n∈N that give the remainder 2 when divided by n.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Fourth set is all numbers n∈N that give the remainder 3 when divided by n.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( " . . . And so on . . . \r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Last set is all numbers n∈N that give the remainder (n-1) when divided by n.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "In all, there are n such sets in this partition.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );