document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1210514>Question 1210514</A>: <I><SPAN STYLE=\"word-break: break-all;\"> For a positive integer n, let \tau(n) be the sum of the positive integer divisors of n.  Find the number of values of n, where 1 \le n \le 25, such that \tau(n) = 1. </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #853182 by </B><A HREF=/tutors/aboutme.mpl?userid=greenestamps><B>greenestamps(13248)</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=853182\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <br><BR>\n" );
document.write( "The problem as posted is either (1) trivial or (2) posted incorrectly.<br><BR>\n" );
document.write( "The described function is the sum of the positive integer divisors of the positive integer n.<br><BR>\n" );
document.write( "For every positive integer n greater than 1, the divisors include both 1 and n, so the sum of the integer divisors of n is at least 1+n.<br><BR>\n" );
document.write( "So (trivially) 1 is the only positive integer n for which the sum of the divisors of n is equal to 1; therefor, the number of positive integers that satisfy the given condition is 1.<br><BR>\n" );
document.write( "ANSWER: 1<br><BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );