document.write( "Question 192088: I think this is the right section...this problem isn't catagorized in any particular subject, so I had to guess for myself.\r
\n" ); document.write( "\n" ); document.write( "Mr. and Mrs. Zimmerman want to name their baby Zimmerman so that its monogram (first, middle, and last initials) will be in alphabetical order with no letters repeated. How many such monograms are possible?
\n" ); document.write( "

Algebra.Com's Answer #144179 by stanbon(75887)\"\" \"About 
You can put this solution on YOUR website!
Mr. and Mrs. Zimmerman want to name their baby Zimmerman so that its monogram (first, middle, and last initials) will be in alphabetical order with no letters repeated. How many such monograms are possible?
\n" ); document.write( "------------
\n" ); document.write( "Number of ways to pick 3 letters: 26C3 = 2600
\n" ); document.write( "Number of ways to put the letters in alphabetical order: 1
\n" ); document.write( "--------------
\n" ); document.write( "Final answer: 2600*1 = 2600 monogram sets
\n" ); document.write( "==============================================
\n" ); document.write( "Cheers,
\n" ); document.write( "Stan H.
\n" ); document.write( "
\n" );