作者assassin88 (2010)
看板Grad-ProbAsk
標題[理工] [離散]-遞迴
時間Sun Feb 7 15:46:25 2010
For n >= 1, let an be the number of ways to write n as an ordered sum of
positive integer where each summand is at least 2.
請問這一題要怎麼想？
完全沒有idea..麻煩指導了~感謝！
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.57.105.163