離散數學›Ch5 遞迴關係第 14 題/共 18 題
14. Recurrence Relation、Fibonacci
#LS-05-014易Recurrence RelationFibonacci
Let be the number of ways in which a line of people can be formed such that no two males are standing beside each other (each person is either M or F). For example, . Which of the following statements are correct?
📄 中央115
▤完整推導請見《WH 資工筆記 · 離散數學》Ch5 遞迴關係