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.
The answer is ou need to rewrite the equation to make it easy... and let it equal zero
<span>2<span>x2</span>−8x+4=0</span>
which will become
<span>2(<span>x2</span>−4x+2)=0</span>
you need to solve
<span><span>x2</span>−4x+2=0</span><span>
by completing the square or the general quadratic formula.</span>
