Generating functions: first examples

video-placeholder
Loading...
Ver programa

Reseñas

4.7 (112 calificaciones)

  • 5 stars
    81,25 %
  • 4 stars
    13,39 %
  • 3 stars
    2,67 %
  • 1 star
    2,67 %

RR

21 de ago. de 2017

Filled StarFilled StarFilled StarFilled StarFilled Star

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

RB

17 de nov. de 2020

Filled StarFilled StarFilled StarFilled StarFilled Star

This course is very well put together. The lectures are very clear and cover a wide range of interesting topics in combinatorics.

De la lección

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.

Impartido por:

  • Placeholder

    Evgeny Smirnov

    Associate Professor

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.