document.write( "Question 879135: How many distinguishable ways can be written using all the letters in the word ALGEBRA? \n" ); document.write( "
Algebra.Com's Answer #530531 by Theo(13342)\"\" \"About 
You can put this solution on YOUR website!
Number of letters in this word are:
\n" ); document.write( "A = 2
\n" ); document.write( "L = 1
\n" ); document.write( "G = 1
\n" ); document.write( "E = 1
\n" ); document.write( "B = 1
\n" ); document.write( "R = 1
\n" ); document.write( "There are 7 total letters with 2 of them being the same.
\n" ); document.write( "The formula is 7! / 2! = 2520.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "This is hard to show because there are so many possibilities, but I can show it with a simpler type problem.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Assume the letters ABC.
\n" ); document.write( "The number of possible arrangements are 3! = 6
\n" ); document.write( "Those arrangements are:
\n" ); document.write( "ABC
\n" ); document.write( "ACB
\n" ); document.write( "BAC
\n" ); document.write( "BCA
\n" ); document.write( "CAB
\n" ); document.write( "CBA\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Now assume the letters AAC.
\n" ); document.write( "The number of possible arrangements are 3! / 2! = 3.
\n" ); document.write( "Those arrangements are:
\n" ); document.write( "AAC
\n" ); document.write( "ACA
\n" ); document.write( "CAA\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "You have essentially replace the B with another A.
\n" ); document.write( "Where you had ABC and ACB, you now only have AAC and ACA
\n" ); document.write( "Where you had BAC and BCA, you now only have AAC and ACA
\n" ); document.write( "Where you had CAB and CBA, you now only have CAA and CAA.
\n" ); document.write( "You now have AAC twice and ACA twice and CAA twice.
\n" ); document.write( "The number of unique arrangements is only 3 which are AAC and ACA and CAA.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The general formula for number of unique permutations is:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "P = n! / (x1! * x2! * ... xn!) where:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "n is the number of letters.
\n" ); document.write( "x1, x2, ..., xn are the number of letters that are the same.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "For example:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Original letters are ABCDEFG\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Formula is 7!\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Original letters are AACCEEG\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Formula is 7! / (2! * 2! * 2!)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Original letters are AAAAABB\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Formula is 7! / (5! * 2!)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "That's how it works.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );