2n – 7 Prove that the sequence with nth u, = (a) is monotonic increasing, (b) is bounded above, (c) is Зп + 2 bounded below, (d) is bounded, (e) has a limit.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
#2.15) I have to explain each step of the solved problems in the picture.
Bounded monotonic sequences
2n – 7
2.15.
Prove that the sequence with nth u,
(a) is monotonic increasing, (b) is bounded above, (c) is
Зп + 2
bounded below, (d) is bounded, (e) has a limit.
(a) {u„} is monotonic increasing if up+1 > up, n = 1, 2, 3, . . . Now
2(п + 1) — 7
2n – 7
2n - 5
if and only if
2n – 7
3(n + 1) + 2 = 3n + 2
2n + 5
Зп + 2
or (2n – 5) (3n + 2) > (2n – 7) (3n + 5), 6n² – 11n – 10 > 6n² – 11n – 35, i.e., –10> -35, which is true. Thus,
by reversal of steps in the inequalities, we see that {u,} is monotonic increasing. Actually, since –10>-35, the
sequence is strictly increasing.
(b) By writing some terms of the sequence, we may guess that an upper bound is 2 (for example). To prove
this we must show that u, < 2. If (2n – 7)/(3n + 2) < 2, then 2n – 7 < 6n + 4 or –4n < 11, which is true.
Reversal of steps proves that 2 is an upper bound.
(c) Since this particular sequence is monotonic increasing, the first term –1 is a lower bound; i.e., u,
n = 1, 2, 3, . .. Any number less than – 1 is also a lower bound.
-1,
(d) Since the sequence has an upper and a lower bound, it is bounded. Thus, for example, we can write
Tu,l < 2 for all n.
(e) Since every bounded monotonic (increasing or decreasing) sequence has a limit, the given sequence has
2
2 -7/n
lim
n- 3 + 2/n
2n – 7
a limit. In fact, lim
n0 3n + 2
3
Transcribed Image Text:Bounded monotonic sequences 2n – 7 2.15. Prove that the sequence with nth u, (a) is monotonic increasing, (b) is bounded above, (c) is Зп + 2 bounded below, (d) is bounded, (e) has a limit. (a) {u„} is monotonic increasing if up+1 > up, n = 1, 2, 3, . . . Now 2(п + 1) — 7 2n – 7 2n - 5 if and only if 2n – 7 3(n + 1) + 2 = 3n + 2 2n + 5 Зп + 2 or (2n – 5) (3n + 2) > (2n – 7) (3n + 5), 6n² – 11n – 10 > 6n² – 11n – 35, i.e., –10> -35, which is true. Thus, by reversal of steps in the inequalities, we see that {u,} is monotonic increasing. Actually, since –10>-35, the sequence is strictly increasing. (b) By writing some terms of the sequence, we may guess that an upper bound is 2 (for example). To prove this we must show that u, < 2. If (2n – 7)/(3n + 2) < 2, then 2n – 7 < 6n + 4 or –4n < 11, which is true. Reversal of steps proves that 2 is an upper bound. (c) Since this particular sequence is monotonic increasing, the first term –1 is a lower bound; i.e., u, n = 1, 2, 3, . .. Any number less than – 1 is also a lower bound. -1, (d) Since the sequence has an upper and a lower bound, it is bounded. Thus, for example, we can write Tu,l < 2 for all n. (e) Since every bounded monotonic (increasing or decreasing) sequence has a limit, the given sequence has 2 2 -7/n lim n- 3 + 2/n 2n – 7 a limit. In fact, lim n0 3n + 2 3
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Paths and Circuits
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
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…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,