所屬科目: 中山◆資工◆離散數學
(a) Find the exponential generating function for the above counting such that the coefficient of is the answer of the above counting.
(a) For each integer n ≥ 1, let an be the number of strings in A* of length n. Find and solve a recurrence relation for .
(b) For each integer n z 1, let bn be the number of strings in A* which are of length n and exactly divided by 2 when we regard each of the strings as a binary number. Find .