離散數學›Ch5 遞迴關係
第 14 題/共 18 題
◀ LS 14/18
14. Recurrence Relation、Fibonacci
#LS-05-014易Recurrence RelationFibonacci

Let ana_n be the number of ways in which a line of nn people can be formed such that no two males are standing beside each other (each person is either M or F). For example, a3=5a_3 = 5. Which of the following statements are correct?

📄 中央115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 離散數學》Ch5 遞迴關係
本章題號 · 1–18 / 18