Problem 3) (2 points): Find an exponential generating function (as a function of $e^x$) for the number of strings of length $n$, made of 1's, 2's and 3's, consisting of an odd number of 1's, an even number of 2's, and any number of 3's.
Added by Jeremiah R.
Close
Step 1
This can be represented by the exponential generating function: f(x) = e^x + e^(2x) + e^(3x) Show more…
Show all steps
Your feedback will help us improve your experience
Kumareshwaran Rathinasabapathy and 78 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Find the exponential generating function for the number of strings of length n formed from the set {a, b, c, d} if there must be at least two a's and the number of c's must be even. Find a closed formula for the coefficients of this exponential generating function.
Supreeta N.
Find an exponential generating function for the number of permutations with repetition of length n of the set {a,b,c} in which there are an odd number of as, even number of bs and any number of cs.
Find a recurrence relation for the number of bit-strings of length n that contain at least one pair of consequent 0's (00).
Sri K.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD