- #1
Goldenwind
- 146
- 0
[SOLVED] Recurrence Relations
I need to express this recursive statement as a nonrecursive formula, using the technique of itteration.
[tex]a_n = (n+1)a_{n-1}[/tex]
[tex]a_0 = 2[/tex]
[tex]a_n = (n+1)a_{n-1}[/tex]
[tex]a_n = (n+1)(n+1)a_{n-2} = (n+1)^{2}a_{n-2}[/tex]
[tex]a_n = (n+1)(n+1)(n+1)a_{n-3} = (n+1)^{3}a_{n-3}[/tex]
[tex]a_n = (n+1)^{n}a_{n-n}[/tex]
[tex]a_n = 2(n+1)^{n}[/tex]
I plugged both the recursive formula, and my answer, into MS-Excel, and they don't match up. They work for n = 0,1, but then my answer start getting larger than the recursive one.
Homework Statement
I need to express this recursive statement as a nonrecursive formula, using the technique of itteration.
[tex]a_n = (n+1)a_{n-1}[/tex]
[tex]a_0 = 2[/tex]
The Attempt at a Solution
[tex]a_n = (n+1)a_{n-1}[/tex]
[tex]a_n = (n+1)(n+1)a_{n-2} = (n+1)^{2}a_{n-2}[/tex]
[tex]a_n = (n+1)(n+1)(n+1)a_{n-3} = (n+1)^{3}a_{n-3}[/tex]
[tex]a_n = (n+1)^{n}a_{n-n}[/tex]
[tex]a_n = 2(n+1)^{n}[/tex]
I plugged both the recursive formula, and my answer, into MS-Excel, and they don't match up. They work for n = 0,1, but then my answer start getting larger than the recursive one.