document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=227124>Question 227124</A>: <I><SPAN STYLE=\"word-break: break-all;\"> how many two digit prime numbers have a remainder of 2 when divided by 7? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #168858 by </B><A HREF=/tutors/aboutme.mpl?userid=solver91311><B>solver91311(24713)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=solver91311><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=solver91311><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=168858\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <font face=\"Garamond\" size=\"+2\">\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "The only way I know how to do this one is to get a list of all the two-digit prime numbers (go to:  http://www.math.utah.edu/~pa/math/primelist.html -- they are all in the first row of the data presented).  Then divide each of them by 7 and count the ones that have a remainder of 2.  If you are using your calculator, you will get a decimal fraction when you divide by 7 (you are only dividing into primes, so none of them will come out even).  If the decimal fraction begins .285714, then you know you have a remainder of 2.  This isn't as onerous as it seems, since there are only 21 two-digit primes.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "John<BR>\n" );
document.write( "<IMG STYLE=\"max-width:80%;\" SRC=\"/cgi-bin/rendertex.cgi?\LARGE e^{i\pi} + 1 = 0\"><BR>\n" );
document.write( "</font> </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );