3. Let fn be the number of strings of length n using the letters A, B, C, D, such that there are an even number of As; 1
Posted: Mon Apr 11, 2022 5:59 am
3. Let fn be the number of strings of length n using the letters A, B, C, D, such that there are an even number of As; 1, 2, 3 or 4 Bs; either 2 or 5 Cs; and at least 1 D. So fo = fi = f2 = f3 = 0, while fa 12 and f5 = 60. Find a generating function for fn, and explain how you got it. =