Back to Strings, Sets, and Binomial Coefficients

Exercise 10

Avg difficulty 2.5

Let XX be the set of the 2626 lowercase English letters and 1010 decimal digits. How many XX-strings of length 1515 satisfy all of the following properties (at the same time)?

  • The first and last symbols of the string are distinct digits (which may appear elsewhere in the string).

  • Precisely four of the symbols in the string are the letter 'tt'.

  • Precisely three characters in the string are elements of the set V={a,e,i,o,u}V=\{a,e,i,o,u\} and these characters are all distinct.

Keller & Trotter, Applied Combinatorics, Strings, Sets, and Binomial Coefficients — Exercises, Exercise 10

AI Tutor

Adapted from Applied Combinatorics © 2006–2025 Mitchel T. Keller, William T. Trotter. Licensed under CC BY-SA 4.0. Source: Applied Combinatorics. Imported at revision 07286c4.