RECURRENCE FORMULA: an+2 = n 0 1 2 23 3 4 5 -2(n+1)an+1+nan+4an (n+1)(n+2) an ao a1 a2 = -a1 az = ay ay - - 2a0 a1-2a0 6 a₁+6a0 12 -5a1+26a0 120

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.5: The Binomial Theorem
Problem 16E
icon
Related questions
Question

Show complete and detailed solution

 

RECURRENCE FORMULA:
an+2 =
n
0
1
2
W|N
3
4
5
FIND a3
-2(n+1) an+1+nan+4an
(n+1)(n+2)
a4
an
ao
a1
a2 = -a1
a3
ay
ay
-
=
-
&
2a0
a1-2a0
6
a₁+6a0
12
-5a1+26a0
120
a5
Transcribed Image Text:RECURRENCE FORMULA: an+2 = n 0 1 2 W|N 3 4 5 FIND a3 -2(n+1) an+1+nan+4an (n+1)(n+2) a4 an ao a1 a2 = -a1 a3 ay ay - = - & 2a0 a1-2a0 6 a₁+6a0 12 -5a1+26a0 120 a5
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning