document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=389187>Question 389187</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Please help me solve this problem.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "How many distinct arrangements can be made with the letters in the <BR>\n" );
document.write( "palindrome “Madam I’m Adam”? (Disregard the apostrophe and <BR>\n" );
document.write( "capitalization.) \r<BR>\n" );
document.write( "\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 #275787 by </B><A HREF=/tutors/aboutme.mpl?userid=richard1234><B>richard1234(7193)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=richard1234><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=richard1234><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=275787\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> There are 11 factorial ways to arrange the letters, if they are all distinguishable. However, the A's are indistinguishable, so are the M's, etc. To account for the four A's, we divide by 4! since each permutation is being counted 4! times. Do the same with the M's and D's. Thus the total number is\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "11!/(4!4!2!) </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );