An Explicit Formula for the Fibonacci Sequence; How to Solve Recursions.

preview_player
Показать описание
Sequences frequently appear in math competitions. In this video I go over how to find an explicit formula for the Fibonacci sequence. Then, I discuss how in general we can solve many recursions. This is one of many methods to find an explicit formula for a recurrence relation.

For problems on sequences and series check out the following playlists:

Рекомендации по теме
Комментарии
Автор

Have to watch three times to get my head around it(My skll issue). Amazing work as always...

vikrantsingh
Автор

At 13:33, are you sure it isn’t use r^n, nr^n, n(n-1)r^n, n(n-1)(n-2)r^n as many times as needed? I don’t think the text makes sense as when you differentiate exponents decrease by 1. Could you pls clarify?

prathikkannan
Автор

Hi, are you familiar with any useful resources that could help me prepare for the IMC ? (the one for university students).

Your videos are really helpful.

Chikhi_Salah