2. Let an be the sequence defined inductively by a₁ = 2 and an+1 = 2 2 an + an (a) Prove by induction that an € [1, 2] for all n € N. (b) Prove that a ≥ 2 for all n € N. (c) Hence prove that the sequence is decreasing. (d) We already know that (an) is bounded below (by (a)) so it follows, by the mono- tone convergence theorem, that (an) converges to some limit L. Show that L> 0 and L² = 2.
2. Let an be the sequence defined inductively by a₁ = 2 and an+1 = 2 2 an + an (a) Prove by induction that an € [1, 2] for all n € N. (b) Prove that a ≥ 2 for all n € N. (c) Hence prove that the sequence is decreasing. (d) We already know that (an) is bounded below (by (a)) so it follows, by the mono- tone convergence theorem, that (an) converges to some limit L. Show that L> 0 and L² = 2.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
![1
2. Let an be the sequence defined inductively by a₁ = 2 and an+1 =
(a) Prove by induction that an € [1, 2] for all n € N.
(b) Prove that a ≥2 for all ne N.
an +
an
(c) Hence prove that the sequence is decreasing.
(d) We already know that (an) is bounded below (by (a)) so it follows, by the mono-
tone convergence theorem, that (an) converges to some limit L. Show that L>0
and L² = 2.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fed029406-a1c1-473f-a3a0-6fd0fbd8e89d%2Fd6165dde-a152-4dfd-b99a-a763b11d5153%2Fnsl9qh_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1
2. Let an be the sequence defined inductively by a₁ = 2 and an+1 =
(a) Prove by induction that an € [1, 2] for all n € N.
(b) Prove that a ≥2 for all ne N.
an +
an
(c) Hence prove that the sequence is decreasing.
(d) We already know that (an) is bounded below (by (a)) so it follows, by the mono-
tone convergence theorem, that (an) converges to some limit L. Show that L>0
and L² = 2.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps

Recommended textbooks for you

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,

