consider the recurrence relation
(I) F(n) = F(n-1) + F(n-2) for n=2,3,4,..., with F(0)=F(1)=1
show that q(n) = C(n,0) + C(n-1,1) + C(n-2,2) + ... + C(1,n-1) + C(0,n)
is a solution of (I)
http://ezproxy.lib.ncu.edu.tw:8080/~arhui/cexamn/exam/SC01_88_10.pdf
第三題的第2小題
請問這題要怎麼解呢?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.166.116.108