document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=6874>Question 6874</A>: <I><SPAN STYLE=\"word-break: break-all;\"> I am having trouble with a question, and I think I know the answer and I just need someone to tell me if it is right.  How many arrangements of the letters in the word o l i v e can you make if each arrangement must use three letter?   <BR>\n" );
document.write( "I think the answer is 5*4*3*2*1 is this answer right, Can someone please let me know. My paper is due tomorrow.  Please? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #3777 by </B><A HREF=/tutors/aboutme.mpl?userid=Pieter><B>Pieter(35)</B></A><img src=\"/images/stars/stars-07.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=Pieter><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/images/nopicture.jpg><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=3777\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> the solution to this problem is called 'permutations'.\r<BR>\n" );
document.write( "\n" );
document.write( "the number of arrangements you can make with n different symbols, is equal to n!. That is called the 'faculty' of n, defined as n! = n x (n-1) x ... 2 x 1.<BR>\n" );
document.write( "This means that you are right!\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "The word in you problem counts 5 symbols, so you can make 120 arrangements with it.\r<BR>\n" );
document.write( "\n" );
document.write( "greets,<BR>\n" );
document.write( "Pieter<BR>\n" );
document.write( "contact me if you have any problems!<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );