document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1184449>Question 1184449</A>: <I><SPAN STYLE=\"word-break: break-all;\"> please help me with this question, it would be highly appreciated: \r<BR>\n" );
document.write( "\n" );
document.write( "3 tiles with the letter X on them and 3 tiles with the letter O on them are placed in a row. The order is chosen at random. What is the probability that no two adjacent tiles have the same letter on them?\r<BR>\n" );
document.write( "\n" );
document.write( "Thank you taking time out of your day to help me! <BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #815041 by </B><A HREF=/tutors/aboutme.mpl?userid=robertb><B>robertb(5830)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=robertb><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=robertb><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=815041\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> The number of ways of lining up 6 objects 3 of which are identical and the other 3 also identical (but different from the previous three) is\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "<IMG STYLE=\"max-width:80%;\" SRC=/cgi-bin/plot-formula.mpl?expression=6%21%2F%283%213%21%29+=+20 ALIGN=MIDDLE  ALT=\"6%21%2F%283%213%21%29+=+20\"   DISABLED_style= \"max-width:90%; height:auto;\" >.  (You can even list these arrangements!)\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Now two such arrangements which satisfy the condition are XOXOXO and OXOXOX.  \r<BR>\n" );
document.write( "\n" );
document.write( "The movement of even one letter in either arrangement into another spot will produce <BR>\n" );
document.write( "an arrangement where two adjacent tiles have the same letter on them. This resulting arrangement will belong to the other 18 arrangements.  <BR>\n" );
document.write( "In other words XOXOXO and OXOXOX uniquely satisfy the condition of the problem.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Therefore the probability that no two adjacent tiles have the same letter on them is 2/20, or 1/10. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );