Solving the Fibonacci recurrence 2: Binet formula

Loading...
查看授课大纲

审阅

4.6(90 个评分)
  • 5 stars
    79%
  • 4 stars
    14%
  • 3 stars
    3%
  • 1 star
    3%
SS

Apr 11, 2020

i loved the course thanks to the\n\nNational Research University Higher School of Economics

CX

Feb 12, 2018

by far the best math course I had (and I've taken many) on coursera

从本节课中
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.

教学方

  • Evgeny Smirnov

    Evgeny Smirnov

    Associate Professor

探索我们的目录

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