document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=810597>Question 810597</A>: <I><SPAN STYLE=\"word-break: break-all;\"> SOME TREE-DIGIT NUMBERS, SUCH AS 101 AND 313, READ THE SAME FORWARD AND BACKWARD, IF YOU SELECT A NUMBER FROM ALL THREE-DIGIT NUMBERS, FIND THE PROBABILITY THAT IT WILL READ THE SAME FORWARD AND BACKWARD...? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #488262 by </B><A HREF=/tutors/aboutme.mpl?userid=Okeke_Christian><B>Okeke_Christian(26)</B></A><img src=\"/images/stars/stars-07.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=Okeke_Christian><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=Okeke_Christian><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=488262\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> If I have to count from 101 to 999, it'd take a lot of effort to extract those palindromes. Here's what you should do.\r<BR>\n" );
document.write( "\n" );
document.write( "Since you know what palindromes are, count how many you can find between (and including) 101 and 999.\r<BR>\n" );
document.write( "\n" );
document.write( "Then you go n(P)/n(T)<BR>\n" );
document.write( "*n(P) - possible outcomes<BR>\n" );
document.write( "*n(T) - total number of outcomes\r<BR>\n" );
document.write( "\n" );
document.write( "n(T) is 900 (there're 900 three-digit numbers!)\r<BR>\n" );
document.write( "\n" );
document.write( "so n(P)/900 is your answer.\r<BR>\n" );
document.write( "\n" );
document.write( "PSSST! I just checked. They each (1 through 9) have 10 palindromes. Total of 90.<BR>\n" );
document.write( "So your answer should be 90/900, which is 1/10!\r<BR>\n" );
document.write( "\n" );
document.write( "Thanks for the challenge! </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );