Mr. and Mrs. Zeta want to name their baby Zeta so that its monogram (first, middle and last initials) will be in alphabetical order with no letters repeated. How many such monograms are possible?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First Solution : The possible monograms are A B Z , A C Z , . . . , W X Z , W Y Z , X Y Z . Any two-element subset of the first 25 letters of alphabet, when used in alphabetical order, will produce a suitable monogram when combined with Z . For example, the subset L , J = J , L will produce J L Z . Furthermore, to every suitable monogram there corresponds exactly one two-element subsets that can be formed from a set of 25 letters, and there are ( 2 2 5 ) = 3 0 0 such subsets.
Second Solution : When Z is fixed as the last initial. If the first initial is A, there are 24 choices for the middle initial, e.g., B , C , D , . . . , Y . Similarly, there are 23 choices for the middle initial if the first initial is B, e.g. C , D , E , . . . , Y . Continuing in this way there are a total of 2 4 + 2 3 + 2 2 + . . . + 1 = 2 2 4 ( 2 5 ) = 3 0 0 suitable monograms.