document.write( "Question 1197425: (a) How many words can be formed using letter of PEPSUDENT using each letter at most once?
\n" ); document.write( " i) If each letter must be used,
\n" ); document.write( " ii) If some or all the letters may be omitted. \n" ); document.write( "

Algebra.Com's Answer #830691 by math_helper(2461) $\"\"$ $\"About$

You can put this solution on YOUR website!


\n" );
document.write( "I think the conventional understanding of using \"every letter once\" means to include the duplicated letters.  For this problem, you would permute all 9 letters but then divide by the arrangements of the duplicates:\r
\n" );
document.write( "\n" );
document.write( "    9!/(2!*2!) = 362880 / 4 = 90720\r
\n" );
document.write( "\n" );
document.write( "OF course, this is also assuming each \"word\" is just a unique arrangement of letters, and not a dictionary word.\r
\n" );
document.write( "\n" );
document.write( "----
\n" );
document.write( "EDIT:
\n" );
document.write( "After re-reading, it is not clear to me.  If each letter must be used \"at most once\" then why did the problem statement give the duplicate letters?   The formulation of the problem statement could be better.    \n" );
document.write( "

\n" );