= {₁ b) B= 1 2n +1 : nez}.

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
I have attached the solution my question is 1b) In the solution I don’t understand why it said if n belongs to z with n>=0 And then it says if n belongs to z with n
property¹ there exists n E N such that n >
doesn't exist.
1b) If n E Z with n ≥ 0, then 2n + 1 ≥ 1 and
1
2n +1
If ne Z with n < -1, then 2n +1 < -1 and
0 <
-1 A
Therefore, for all ne Z we have -1 <
1-E
2€
1
1c) For all n EN\ {0}, we see that n -
n
21:
1
2n + 1
1
2n + 1
1
have
= 1, then 1 = max B = sup B. Since for n = -1 we have
2n +1
-1 = min B = inf B.
<1.
20; since
Therefore 0 inf A. Since 0 A, min A
< 0.
<1; then B is bounded.
1
n
< 1, we have
1
n--> 1-
n
- 1/120.
n
Since for n = 0 we
1
2n + 1
= -1, then
Therefore C is bounded from below. Since for n = 1, n
¹Archimedean property. Let a, b e R, a, b>0. Then there exists neN such that na > b.
2017 Politecnico di Torino
= 0, we have 0 = min C = inf C.
Transcribed Image Text:property¹ there exists n E N such that n > doesn't exist. 1b) If n E Z with n ≥ 0, then 2n + 1 ≥ 1 and 1 2n +1 If ne Z with n < -1, then 2n +1 < -1 and 0 < -1 A Therefore, for all ne Z we have -1 < 1-E 2€ 1 1c) For all n EN\ {0}, we see that n - n 21: 1 2n + 1 1 2n + 1 1 have = 1, then 1 = max B = sup B. Since for n = -1 we have 2n +1 -1 = min B = inf B. <1. 20; since Therefore 0 inf A. Since 0 A, min A < 0. <1; then B is bounded. 1 n < 1, we have 1 n--> 1- n - 1/120. n Since for n = 0 we 1 2n + 1 = -1, then Therefore C is bounded from below. Since for n = 1, n ¹Archimedean property. Let a, b e R, a, b>0. Then there exists neN such that na > b. 2017 Politecnico di Torino = 0, we have 0 = min C = inf C.
Exercise 1. Tell whether the following sets are bounded from below and/or from above, specifying
infimum, supremum and minimum and maximum, if they exist.
{2+1 neN}.
2n
1
b) B=
nez}.
2n +1
c) C = {n-1: ne N\ {0}}.
(-1)
0 = {1+ (=17: n=N}.
n+1
a) A =
d) D
:
e) E=
:
E = {neN: 2+1€N}.
E
2n
n-1
ƒ) F = {[1 + (-1)³] ¹ = ¹; n € N\ {0}}.
:
n
1
9) G={₁2: neN\ {0}}.
g)
1-2-n
h) H = {-n: neN}.
n²
i) I =
91-{nEN: 32 +3 >1}.
3n+1
ne N\{0}}.
1
3) J = {2 cos (nm) + : ne N
j)
n
Transcribed Image Text:Exercise 1. Tell whether the following sets are bounded from below and/or from above, specifying infimum, supremum and minimum and maximum, if they exist. {2+1 neN}. 2n 1 b) B= nez}. 2n +1 c) C = {n-1: ne N\ {0}}. (-1) 0 = {1+ (=17: n=N}. n+1 a) A = d) D : e) E= : E = {neN: 2+1€N}. E 2n n-1 ƒ) F = {[1 + (-1)³] ¹ = ¹; n € N\ {0}}. : n 1 9) G={₁2: neN\ {0}}. g) 1-2-n h) H = {-n: neN}. n² i) I = 91-{nEN: 32 +3 >1}. 3n+1 ne N\{0}}. 1 3) J = {2 cos (nm) + : ne N j) n
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

no I understand what you meant but that was not my question when he divided it into two parts I and II how can i know that it is the correct way to divide these two parts why can it not be n >= 0 and n<= -3 for example how can i know those values for sure.

Solution
Bartleby Expert
SEE SOLUTION
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,