Evaluating sequences in recursive form | Mathematics I | High School Math | Khan Academy

preview_player
Показать описание
Sal shows how to evaluate a sequence that is defined with a recursive formula. This definition gives the base case and then defines how to find the subsequent terms using the base case.

High School Math on Khan Academy: Did you realize that the word "algebra" comes from Arabic (just like "algorithm" and "al jazeera" and "Aladdin")? And what is so great about algebra anyway? This tutorial doesn't explore algebra so much as it introduces the history and ideas that underpin it.

For free. For everyone. Forever. #YouCanLearnAnything

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

THANK YOU!
My teacher is terrible at actually teaching me stuff that I can remember and apply, and I did not get the concept. This made it much easier for the HW

benfinley
Автор

omfg tysm i have a test on this bull crap and i finally understand

jaylonignacio
Автор

in the first example what is the advantage of that notation over the more simple 0.8+3.2n, which generates the same sequence?

robinaylott
Автор

A sequence that's the sum of the two previous numbers eh?

OatmealTheCrazy
Автор

I'm not sure why but i don't get any sound on your math videos and on this video there are no subtitles available.

I don't get this issue with any other youtube videos

jacobsmith
Автор

You had a mistake in the minute 4:30. g(6)=23.2 not 20.

behrouzjt