Find the exponential generating function for the number of alphanumeric strings of length n n formed from the 26 26 uppercase le
tters of the English alphabet and 10 10 decimal digits if each vowel must appear at least one time; the letter T T must appear at least three times; the letter Z Z may appear at most three times; each even digit must appear an even number of times; and each odd digit must appear an odd number of times.
1 answer:
You might be interested in
