document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=388804>Question 388804</A>: <I><SPAN STYLE=\"word-break: break-all;\"> how many ways can the letters of the word Onion be arranged so that the 2 consonants are never together. </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #275211 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=275211\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Total number of ways of arranging the letters of \"onion\" - Total number of ways of arranging the letters of \"onion\" with n,n together = <IMG STYLE=\"max-width:80%;\" SRC=/cgi-bin/plot-formula.mpl?expression=5%21%2F%282%212%211%21%29+-+4%21%2F%282%211%211%21%29+=+30+-+12+=+18 ALIGN=MIDDLE  ALT=\"5%21%2F%282%212%211%21%29+-+4%21%2F%282%211%211%21%29+=+30+-+12+=+18\"   DISABLED_style= \"max-width:90%; height:auto;\" >. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );