- Use The Indicated Generating Function Method For Each Solution Show All Steps 1 Find The Number Of Binary Strings Of 1 (45.43 KiB) Viewed 25 times
thank you
Use the indicated generating function method for each solution. Show all steps. 1. Find the number of binary strings of length n that contain at most 2 consecutive Os anywhere in the string. An example when n = 20 is 01001101001111001111. Use the method of 04.08.2022 (see also 04.29.2022). Another way to proceed is to think about sequences of Os and 00s and how they are separated by ls. Your final answer must not be a large sum of terms. 2. Find the number of rooted planar quaternary trees having 3n+1 leaves. Use the same techniques illustrated on 04.18.2022 and 04.19.2022. Your final answer must not be a large sum of terms. 3. Find the number of derangements of AABBCC. Use the method of 04.22.2022 4. Find the number of permutations of [n] whose disjoint cycle structures are products of 3 cycles and 5 cycles. Use the method of 04.25.2022. 5. Simplify Σ a+b+c=n a € {1,2,3,4,...) be {1, 2, 3, 4, ...} ce {1,2,3,4,... } Use the method of 04.26.2022