2016 年 1月 20 日随笔档案 - meekyan

摘要： RecurrencesConsider recurrent functions of the following form:f(n) = a1f(n − 1) + a2f(n − 2) + a3f(n − 3) + . . . + adf(n − d), for... 阅读全文

posted @ 2016-01-20 23:44 meekyan 阅读(258) 评论(0) 推荐(0) 编辑

摘要： Modular FibonacciThe Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are deﬁned by the recurrence:F0 = 0F1 = 1Fi = Fi−1 + F... 阅读全文

posted @ 2016-01-20 22:40 meekyan 阅读(440) 评论(0) 推荐(0) 编辑

Meek