Solving the Fibonacci recurrence 2: Binet formula

Loading...
查看授课大纲

审阅

4.7(102 个评分)
  • 5 stars
    81.37%
  • 4 stars
    12.74%
  • 3 stars
    2.94%
  • 1 star
    2.94%
RR

Aug 22, 2017

Great lectures and content. I really enjoyed it. However, the solutions exercises could be clearer and in more detail. Thank you!

DP

Apr 21, 2017

Very good gourse, I persoally enjoyed the lectures in which the relatipnship with other areas of mathematics were discussed.

从本节课中
Generating functions: a unified approach to combinatorial problems. Solving linear recurrences
We introduce the central notion of our course, the notion of a generating function. We start with studying properties of formal power series and then apply the machinery of generating functions to solving linear recurrence relations.

教学方

  • Placeholder

    Evgeny Smirnov

    Associate Professor

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。