Consider the following sequence defined recursively: aj = 5, a2 = 8, an+1 = 2an – an-1 + 2, n > 2. Prove that an = n² + 4 for all n E N.

College Algebra
1st Edition
ISBN:9781938168383
Author:Jay Abramson
Publisher:Jay Abramson
Chapter9: Sequences, Probability And Counting Theory
Section9.1: Sequences And Their Notations
Problem 67SE: Consider the sequence defined by an=68n. Is an=421 a term in the sequence? Verify the result.
icon
Related questions
Question

PSG Q1

Consider the following sequence defined recursively:
а1 %3D 5, а2 — 8, аn+1 —
: 2ат — ап-1 + 2, п > 2.
Prove that an = n² +4 for all n E N.
Transcribed Image Text:Consider the following sequence defined recursively: а1 %3D 5, а2 — 8, аn+1 — : 2ат — ап-1 + 2, п > 2. Prove that an = n² +4 for all n E N.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
Recommended textbooks for you
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning