Item 2.1.3.b.
This is a recursive definition. We continue \(a_2 = 2\text{,}\) \(a_3 = 3\text{,}\) \(a_4 = 4\text{,}\) \(a_5 = 5\text{,}\) and so on. A closed formula is \(a_n = n\text{.}\)
This is a recursive definition. We continue \(a_2 = 2\text{,}\) \(a_3 = 3\text{,}\) \(a_4 = 4\text{,}\) \(a_5 = 5\text{,}\) and so on. A closed formula is \(a_n = n\text{.}\)