0% found this document useful (0 votes)
232 views58 pagesSolution of Real Analysis by Bartle
solution of real analysis by bartle
Uploaded by
Fahim ShahCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
232 views58 pagesSolution of Real Analysis by Bartle
solution of real analysis by bartle
Uploaded by
Fahim ShahCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 58
@ Katarina Supe 50% 0@
Lets remind ourselves the definition:
The union of sets A and B is the set
AUB:= {4:26 Aorsre B}
The intersection of sets A and B is the set
AN B:= {e:2€ Aand r€ B}
The complement of B relative to A is the set
A\B:={z:r€ Aands ¢ B}
First lets write the given sets in a different way which will give us a notion
of these sets.
A= {1,2,3.4,..., 19, 20}
B = {2,5,8, 11. 14,17, 20, 23, ...}
C = (3,5, 7,9, 11, 13, 15,17, 19, 21. ...}
Now we can see that A is a sct of natural numbers from 1 to 20. B is a set
of all natural numbers that give us a remainder 2 after dividing them with
3 and C is a set of odd natural numbers greater than 1.
(a)
Now we have to determine the intersection of three given sets. By the
definition, lets first determine the intersection of A and B since the intersection
is associative.
Al:= ANB ={x:r€ And ze B) = {2,5,8,11, 14,17, 20}
Now all we are left to do is determine the intersection of A’ and C
A'NC = {a4 € Aland x € C} = (5,11, 17}
We easily found those numbers just by selecting the odd numbers from the
set A’. Therefore. the final solution ix BN
2 @
(b)
In assignment (a) we have already determined the intersection of sets A and
B and defined it as A’. All we have to do now is find the complement of C
relative to A’ using the above definition
A\ Cs (sre A’ and rg C} = (2,8, 11,20)
We found that set just by selecting the even numbers in set A’ since set C
is consisted only of odd numbers. Therefore, the final solution is
(c)
Now we first have to determine the intersection of sets A and C using the
definition above
C= ANC = {aia € A and x €C} = {3,5,7.9,11, 13,15, 17,19}
We choose those numbers since the set A is consisted of all natural numbers
less than 20 and we can see that all odd numbers greater than 1 in that set
are the same as in C. Now we have to obtain the complement of B relative
to C’ using the above definition
C\B
z:2€C' ands ¢ B} = {3,7,9, 13,15, 19}
We did that just by removing all natural numbers which have a reminder 2
when dividing by 3 from the set C’. Therefore, the final solution is
(AN O)\ B= (3,7,9.13, 15, 19)
RESULT
(a) ANBNC = {5, 11,17}
(b) (ANB) \C = {2,8, 14, 20}
(c) (ANC) \ B= {3,7,9, 13, 15, 19} (a) A\(B\ A)=A
C On
er
1) Draw B\ A.
2) Draw A \ (B \ A).
3) See the resulted set A.
(b) A\(A\B)=ANB
ee > 1) Draw A\ B.
2) Draw A\ (A\ B).
3) See the resulted set AN B. S
1) Draw B\ A.
2) Draw AN(B\ A).
3) See the resulted set 0.
RESULT
(a) A\(B\ A) =A.
(b) A\(A\B)=AnNB
(c) AN(B\ A) =0 To show an equivalence between two statements, we can show that each
implies the other. That'll be our strategy here. So up first ...
ACB=>ANB=A:
Remember that to prove equality of two sets, we need to show that each
is bset of the other. However, A B will always be a subset of A by
|. So we really just need to show that
ACB => ACANB
Let's do that.
Suppose that A C B. Then that means that for every x € A, we have x € B.
Now let a such that a € A. From the above, we thus see that a € B as well.
Hence a € ANB. Since this is true for any a € A, we see that AC AN B.
Hence we have shown AC B => ANB = A as required.
ANB=A=>ACB:
Suppose AN B — A. This means a couple of things, but in particular it
means that A C ANB which says that ifr € Athens € ANB.. Let a such
that a ¢ A. By supposition then a € ANB. But AN BC B. Hence ac B.
Since this is true for any a € A, we see that AC B.
Hence we have shown that AN B= A => AC B as required.
Qa
RESULT
First prove AC B => ANB = A. Hint: AN B = A is the same as
AN BC Aand AC ANB and one of those is true by definition.
Then prove AN B = A => AC B. Hint: For this, it suffices to prove
ACANB => ACB. « € AN (BUC) if and only if € A and « € BUC if and only if €
Aand r€ BOR re Aand zs € C if and only if r € (AN B)U(ANC)
2
b.
a € AU(BNC) if and only if « € Aor « € BNC if and only if 2 € A or r €
BANDazc€Aorzre€C if and only ifr € (AU B)N (AUC)
RESULT
HINTS:
a. Show that « € AN (BUC) if and only if r € (AN B)U(ANC).
b. Show that 7 € AU(BOC) if and only if x € (AU B)N (AUC). 2 2
We prove both statements using the two inclusions (more precisely, using
Definition 1.1.1).
(a)
D<(A\ B)U(B\ A). Let x € D. Then, by definition of D, x is either in
A but not in B or in B but not in A (this is exactly another interpretation
of “either A or B but not both”). Now to write it using symbols ifr is in
A but not in B, then x € A\B, and if 7 is in B but not in A, then x € B\ A.
Using this, since 2 is either in A but not in B or in B but not in A, we have
that x € A\ Bor € B\ A. So, x € (A\ B)U(B\ A) by the definition
of the union of sets. With this, the inclusion 2 ¢ (A\ B)U(B\ A) is proven.
(A\ B)U(B\ A) CD. Let x € (A\ B)U(B\ A). Then z € A\ Bor
Te B\A. re A\B, then € A, but x ¢ B. So, x is in exnctly one of A
and B, but not both (it is in A. but not in B). Similar conclusion follows if
x ¢ B\ A —then zis in B but not in A. Thus, x € D by definition of D.
With this, the inelusion (A \ B) U(B\ A) C D is proven,
Conclusion. Since DC (A\ B)U(B\ A) and (A\ B)U(B\ A) ¢ D, D and
(A\ B)U(B\ A) contain the same elements, hence (A\ B)U(B\ A) = D.
(b) ~
D(AUB)\ (AO B). Let x € D™The set of elements which are either in
Aor Bis the union of A and B; that is, AUB. The set of elements which are
in both A and 2 is the intersection of A and B: that ix, AM B. Since x is in
cither A and B, but not in both of them, we have that x € (AUB)\(ANB) by
the definition of set difference. With this, the inclusion D ¢ (AUB)\(ANB)
is proven.
w
(AU B)\ (ANB) © D. Let x € (AN B)\ (ANB). Then z © AUB, but
FGANB. This also menns that 2 € Aor € B, utr ¢ ANB. Therefore,
ris in either A or B, but z is not in both A and B. meaning that x € D by
definition of D. With this, the inclusion (AU B) \ (AN B) CD is proven.
Conclusion, Using the same arguments as in the conclusion of (a), we
conclude that (AU B)\ (AM B) = D.
RESULT
HINT: to prove that sets $ and T are equal, we prove that 5 CT and
TcS. ‘¢ Hemant 5O*® 0@
1
Given that A, — {(n + 1k: k © N}. So A, is the set of all the multiples of
(n+1) in N.
a, Note that Aj is the set of al the multiples of 2 that is the set of even
natural numbers. Ag is the set of all the multiples of 3. Therefore Ai Ao
is the set of all even multiples of 3. In other words, Ay 9 Az = {6k : k € N}.
b. Note that n +1 € Ap and no Ap contains 1. So UnAn = N \ {1}. Also,
For any n €N, n ¢ A, and hence MyAn = 0.
RESULT
a. {6k: k € N}
b. N \ {1} and 0, respectively. “
aH al! gs
9:29
1
Part a) The Cartesian product Ax B is represented in the plane by red
lines.
2 2
Part b) The Cartesian product Ax B is represented in the plane by red
lines.
RESULT
a) HINT: you get 4 line segments.
b) HINT: you get 3 line segments.
0 Oo q 1
Part a) The Cartesian product A x B is represented in the plane by red
lines.
2 @
Part b) The Cartesian product A x B is representa in thefplyg® by red
lines:
RESULT
a) HINT: you get 4 line segments.
b) HINT: you get 3 line segments.
O O g 9:30 a
SLADER © =
SUT COMON ISON, 7 OTT TOT SIOIST TT TOT SIOsT
@ 831 expert-verified solutions in this book
Buy on Amazon.com
a Hemant 3.0% 0®@
Cis NOT a function. For, (0,1),(0,-1) € C. Hence 0 has two distinet
images, 0 it can’t be a function.
RESULT
2
Enter your comment here *
We have textbooks in many subjects. Find yours
Q Search textbooks
0 Oo q @
Let a,b R.
(a) If a+b =0 then adding —a to both sides of the equation we have that
(a) + (a+b) = (-a) +0.
Hence, since (—a) + (a+) = ((—a) +4) +6 =0+6 = band (—a)+0=—-a
we have that b= -a.
(b) We have that -(-@) + (-a) = 0.
Adding a to both sides of the equation -(-a) + (-a) = 0 we have that
(-(-@) +(-a)) +a=0+a.
Hence, since
(-(-a) + (-a)) +a = ~(—a) + ((-@) +a) = -(~a) + 0 = ~(~a)
and 0-+a=a we have that —(—a) =a.
(c) By Theorem 2.1.2 (c) we have that that a-0 =0.
Thus, since 1 +(—1) =0 and 1-a=a we have that
0-a=0-a=(1+(-I)ja=1-a+(-1)-a=a+(-la
and therefore, a+ (—1)a = 0.
Adding —a to both sides of the equation a + (—1)a = 0 we have that
-a+(a+(-1)a)=-a+0.
Hence, since
—a+ (a+ (—1)a) = (—a +a) +(—1)a=0+4(-1)a=(-l)a
and —a + 0 = —a we have that (—1)a = —a. Hence, since
—a+(a+(—1)a) = (—-a+a) +(-l)ja=—0+(-lja=(-lja
and —a +0 = —a we have that (—1)a = —a.
4
(d) By item (c) we have that (—1)(—1) = —(-1) and by item (b) we have
that —(-1)=1.
Hence, (—1)(—1) = 1.
RESULT
HINTS:
(a) Add —a to both sides.
(b) Add a to both sides.
(c) We know that a-0 = 0.
(d) Combine (b) and (c). Let a,b € R.
(a) —(a+b)+(a-+) = 0 then adding (—a)-+(—6) to both sides of the equation
we have that (—(a-+ 5) + (a+8)) + (a) + (-B)) = 0+ ((-a) + (-8)).
Observe now that
(—(a +b) + (a +b)) + ((-a) + (-b)) = —(a-+ d) + ((a +8) + (a) + (8)
= —(a +b) + (((a +6) + (—a)) + (-b))
—(a + b) + (((—a) + (a + 4)) + (—8))
—(a +b) + (((-a) +4) +6) + (-b))
—(a+b) + ((0+b) +(—B))
—(a+b) + (b+ (-0))
—(a+6)+0
=-(a+5)
oun wd
and 0 + ((—a) + (—b)) = (—a) + (—0).
Thus, —(a +b) = (-a) + (0).
D2
(b) By exercise 1(¢) we have that (—L)a = —a and (—1)b = —b which gives
us that (—a)(—b) = ((—1)a)((—1)8).
Observe that ((—1)a)((—1)b) = (((=1)a)(—1) )b = ((—1)((-1)a))b = (((—1)(-1)) ab.
By exercise 1(d) we have that (=1)(—1) = Land therefore (((=1)(-1))a)b=
(1ayb = ab.
Hence, (—a)(—b) = ab.
(c) If a0 we have by item (b) thnt (~a) (- ()) mark
a Thus, since a - 1 = 1 we have that (— a(- (:)) = 1 and therefore. by
Theorem 2.1.3(a) we have that — (;) =k,
a) ~ (Ca)
(d) Suppose 6 # 0.
We have that — (=) =- (« . 3):
By item exercise 1(c) we have that — («: i) =(-1) («- i) =((- a).
Again by = coerciee 1(c) we have that (—1)a = —a which gives us that
(-M)e)-f = (-a) t= FO
Hence, — (¢) = { A.
RESULT
HINTS:
(a) Add (—a) + (—b) to both sides.
(b) Exercise 1 can be helpful.
(c) Use (b) and Theorem 2.1.3 (a).
(d) Exercise 1 can be helpful. d) Either x -1=0>
@-1+1=14+05
e+(-1+1)=1>
z+0=1>
v=l
Remember : associative property is
at+b+c=a+(b+c)
Add +1 and ( associative law).
Orz+2=0
1)a4+2-2=-2
2)a+(2—2)=-2
3)7+0=-2
A\.» — —9 3)x+0=-2
4)xu=—-2.
1)Add —2 to both sides
2)By associative
3) Existence of negative element
4) Additive identity.
RESULT For ++ to be the reciprocal of 25, we need to show
(Ad (at) =1 & (aby(27) =1
(7)(ab) = 4y(ab) (Commutativity of multiplication)
= pay (Associativity of multiplication)
=p (4 is reciprocal of a)
| = 7b (x-1=2,¥r ER)
| =1 (} is reciprocal of 6)
|
ab 1) = ab)(h ty ‘Commutativity of multiplication)
ab ba
= a(bhy2 (Associntivity of multiplication) |
malt (} is reciprocal of 6)
=at (x-1=2, Vr € R)
=1 (2 is reciprocal of a)
RESULT
HINT: For ii to be the reciprocal of 4, we need to show
tA )(ab) =1 & (ad)(2)=1 Base of induction:
For n= 1. geal 1
» RHS=7y7 2
So, base ense is verified.
Induction hypothesis:
Suppose that for some m= k € N the following is true.
1 k
1
pat te
Lets show its also Lrue for n= k+l.
1 ke 1
|! 4 t=
Her EF OET FY
iypothesis
is Terciltle dl . 13
0, the reault is also true for n = k-+1. By principle of induction we conclude
that
s 1 n
Tataat tn@et
is true for alln € N.
RESULT
HINT (for the bridge):
ae St seh 1
ED EVE Dey ReT RF HETD
= hy by induetion hypothesis s 2
Consider the formula 15 + 24+... 4:3 = [5ntn + 0] where n EN.
a
Obseveiitias 2 = vel [mas »| = [I]? = 1 which gives us that |
2
_ [me + »| and therefore the formula holds for n = 1.
Assume that the formula is true for some k € N. Then we have that
2
B+. +k) [Feu+0]
Adding (k +1) to both sides of the equation
— 1 2
Py S 4. gkhe [pe+0|
gives us that
2
PHP. FM + (hE 1 = [Fes 0] 4 (+1)
Obsceve now that
[;ak+ »} (b+ 1) = b+ P+ EINE?
=(} pre)
-(4 +t +4) (b+ 12
- [5 (44+) (ray
= [f+ 27] Gre
= [ornare
“
peen(erysn] 2
Thus, 13+29+...449+(k+1)9 = [5a+ 1) ((K+1) + »| and therefore |
the formula holds for n= +1.
| Tlence, the formula holds for all n € N.
RESULT
HINT: induction hypothesis is
2
242+4...4h%= [s+]
Add (k + 1)3 to both sides and simplify the RHS. 1 OQ
Consider the formula 3 +11+...+ (8n —5) = 4n? —n where n €N.
Observe that 3 = 8 — 5 = 8(1) — 5 and 4(1)? -1 =4(1)-1=4-1=3
which gives us that 8(1) —5 = 4(1)? —1 and therefore the formula holds for
n=1,
Assume that the formula is true for some k € N. Then we have that
34 11+...+ (8k —5) = 4h? —k,
Adding 8(k-+1)—5 to both sides of the equation 3+ 11+...+-(8k-5) = dk?-k
gives us that 3+ 11-+...+(8k—5) + (8(k+1)—5) = 4k2—k-+(8(k-+1)—5).
Observe now that
4k? — ke + (8(k +1) — 5) = 4k? —k + (8k +8 —5)
= dk? b+ 8k +3 = 4k + 8k+4—hk-1
= A(k? 4 2k +1) = (ke -+ 1)
= 4(k +1)? -(k+1)
Thus, 3-11 +... + (8k —5) + (8(k +1) — 5) = 4(k +1)? — (k +1) and
therefore the formula holds for n = k +1.
Hence, the formula holds for all n EN.
RESULT
HINT: induction hypothesis is
B4+114...4+(8k—5) =4k? —k
Add 8(k + 1) — 5 to both sides and simplify the RHS. Observe that 1? = 1 and
ey). yt = aya aa
which gives us that 1? = ey and therefore the formula holds
for n= 1.
Assume that the formula is true for some k EN. Then we have that
2-28 48? 4.4 (IR = ay Hee 4
Adding (—1)*9+1(k + 1)? to both sides of the equation
— kk
Pagan. eps = (ay et)
gives us that
Poste Hea atnetesayt= ye HELD yaentiagne
2 ®
Observe now thnt
(ay AED ayer g aye oy EED _ (aye ay?
=(-1)7 (S-a+r)
=(-1)*! (FEE -ae-1)
=(-yM! ¢ 4k — 2k? - Hw?)
2
= yer (Bae
= on ( ieee)
(e+ Yk +1) +1)
= (ern: (GENEID)
Thus.
. : . k= (K+ +0)
Poh IME Nm Pa yen (ez NLeN ED)
and therefore the formula holds for n = k +1,
Hence, the formula holds for all n € N. Thus,
12224374. (IE (181) (ed)? = ( ero (ener)
2
and therefore the formula holds for n = k +1.
Hence, the fornmula holds for all n € N.
RESULT
HINT for the bridge of induction:
aoa. = (nye + (=I? cy Ht ) + (-1)8941 (+ 1)P
yet (HEED pay?
=(-1)* ( z «+1")
a(n (e+ ides I+ n) Consider the statement n* + 5n is divisible by 6 for all n € N.
Observe that 19 +. 5(1) = 145 = 6 = 6(1) which gives us that the statement
is true for n = 1.
Assume that the statement is true for some k € N. Then we have that k34-5k
is divisible by 6 and therefore there exists m € Z such that k* + 5k = 6m.
Observe now that (k + 1)3 + 5(k +1) = h3 4 3k? 4 3k 414 5k 45 =
(k3 + 5k) + 3k? + 3k +6 = (k? + 5k) + 3k(k +1) +6.
If k is odd we have that k+1 is even which gives us 34(4-+1) is divisible by 6.
If k is even we have that 3k(k + 1) is divisible by 6.
Since the two cases above are the only possible cases we have that 3k(+ 1)
is always divisible by 6 and therefore the exists m’ € Z such that 3&(&+ 1) =
6m’.
Thus, we have that (k> + 5k) + 3k(k + 1) +6 = 6m + 6m! + 6(1) =
6(m+m' +1) which gives us that (k + 1)* + 5(& + 1) is divisible by 6
and therefore the statement is true for n = k +1.
Hence, the statement is true for all n € N.
RESULT @
HINT: (kt -+ 1)? +5(k-+ 1) = (h3 + 5k) + 3k(k +1) +6 1 Dp
Consider the statement 52" — 1 is divisible by 8 for all n €N.
Observe that 524) — 1 = 52 — 1 = 25 — 1 = 24 = 8(3) which gives us that
the statement is true for n = 1.
Assume that the statement is true for some k € N. Then we have that 574-1
is divisible by 8 and therefore there exists m € Z such that 5 — 1 = 8m.
Thus, 5°41) — 1 = 57+? — 1 = 5?8(5) — 1 = 5°*(5) — 1 = 25 (5%*) -1 =
25 (57) — 25 + 24 = 25 (57 — 1) + 24 = 25(8m) + 8(3) = 8(25m) — 8(3) =
8 (25m —3) which gives us that 52+") — 1 is divisible by 8 and therefore,
the statement is true for n =k + 1.
Hence, the statement is true for all n € N.
RESULT
HINT: 524+1) — 1 = 25(5?4 — 1) + 24 Consider the statement 5" — dn — 1 is divisible by 16 for all n € N.
Observe that 5! —4(1) —1=5 —4—1= 8 =16(0) which gives us that the |
statement is true for n = 1.
Assuune that the statement is true for some k € N, Then we have that |
5k — dk — 1 is divisible by 16 and therefore there exists mm € Z such that
5K — 4k — 1 = 16m.
Thus,
BE _ g(k 41) — 1 = 5! (5) — 4k 4-1
(5*) — 4k — 5 — 16k + 16k
= 5(5*) — 20k — 5+ 16k
5 ak = 1) + 16k
| = 5(16m) + 16k
= 16 (5m) + 16k
= 16(5m +k) |
t
which gives us that 5*+! — 4(k +1) —1 is divisible by 16 and therefore, the |
statement is true for n =k +1.
| Hence, the statement: is true for all 1 € NY. |
|
RESULT
HINT: 5*+1 — 4(k +1) —1 = 5(5* — 4k — 1) + 16k 14 2
Consider the statement n+ (n+1)*+(n+2)' is divisible by 9 for all n € N.
Observe that 13 + (1+ 1)9 + (1+ 2)% = 1423 +35 = 148427 = 36 =9(4)
which gives us that the statement is true for n = 1.
Assuine that the statement is true for some k € N. Then we have that
k3 4 (k+1)° + (k + 2)" is divisible by 9 and therefore there exists m € Z
such that k? + (k +1)" + (k+2)5 = 9m.
Thus, (A+ 1)9+((k+1)+1)9+((4-+1) +2)9 = (k+1)3 + (k+2)9+(k+3)) =
(kK+1)8 + (K+ 2)3 +h + OK? + 27k +27 = kB + (+ 1)9 + (hk + 2)9 + 9K? +
27k + 27 = Im +9 (kh? + 3k +3) = 9 (m +k? + 3k +3) which gives us that
| (k-+ 1) + ((k-+ 1) +.1)* + ((&-+ 1) + 2)° is divisible by 9 and therefore, the |
statement is true for n = k+ 1.
Hence, the statement is true for all n € N.
RESULT
HINT:
(RAL) + (KAD) 41)9+((A+ 1) +2)3 = K+ (+1) (k4-2)9 4-9? 427k 427 Observe that
1 1 21
133° W)+T’
1 1 1,1 6 2 2
T3tys 3's i 5 +1
1 1 12,1 15 3 3
Tats +57 ~5*35~ 35-77 2at1
1, 1,121,121 _3,1_8 4 4
T3135 '5-7'7-9 7163 63 9 Aa)+1
Thus, we can conjecture that
aay
13'3.6¢° + @r-Nnantl) +l
for alln EN.
Let’s prove our conjecture!
2 q
Consider the statement
+1 __ =?
0" (Qn =1)(Qn41) In+1
for alln EN.
Since 1 -}-—1 we have that the statement is true for n = 1
Td = 3 > Tp aT W* hiave that the statement is true for n= 1.
Assume the statement is true for some k € N. Then we have that
tli, , tk
1-35 3-5 °°" Qk=1(Qk+1)” Wk+T
1
(2k +1) -1NQhR+1) +1)
Byte
163° 365 °°" (Qh-1)(2k41) +7
Adding to both sides of the equation ee
1 1
Qk-DAk+H * BRFHN-NARFHD+
k 1
“+i * @R+D-DAE+ H+)
s ®
‘Thus, since
1
k 1
+1 * By) —-Heer yy ri Vk 241)
k 1
“eat | Bea neers |
1
_ kk +3)
2k + 1)(ak+ 8)
~ G+ NE
_ 2 BRET
© Qk QK+ 3)
_ (2k +i(k+)) |
~ BEF T(E +3) |
1
kt
~ 2k +1
we have that,
a ee 1 4 1 _ kt
TS 3-5 (R—N@k+N) (ARN —NAR+N +1) Ak+t+t
and therefore the statement is true for n= +1.
a = for all EN.
si Be Nersy ~ maT
RESULT
HINT for the bridge of induction:
k 1
rit Bes) -HAk+)+Y
k 1
241 * Gk+2—-)ek+2+D
k 1
Repl * Geers
+1
+3
__ ke
© 2k+1) +1 Observe that
1=12,
143=4=2,
143+ = 3? and
14+34+54+7=16=4,
Thus, we can conjecture that 1+3+5+7+...+(2n—-1) =n? for alla €N.
Let’s prove our conjecture!
2 C
Consider the statement 1+3+45+7+...4+(2n-1) =n? for alln EN.
Since 1 = 2(1) — 1 = 1? we have that the statement is true for n = 1.
Assume the statement is true for some k € N. Then we have that 1 + 3+
54+74...4(2k-1I) =k.
Adding (2(k-+1)—1) to both sides of the equation 14-34-5+7+. ..+(2k-1) =
ke gives us that 14+34+5+47+...4+(2k-1)+(2(k+1)—1) = k?+(2(k+1)-1).
Thus, since &? + (2(k-+ 1) — 1) =k? + (2k4+2—1) =k? 42k +1 =(k+1)?
we have that 1+345+47+4...+(2k—1)+ (2(k +1) -1) =(k+1)? and
therefore the statement is true for n = k +1.
Hence, 1+34+5+7+...+(2n—1) =n? forallneN.
RESULT
HINT: conjecture is:
1434+54+7+...4+(2n-1) =n?
for all n € N. Let ny EN. Let P(n) be a statement for each n € N,n 2 7.
Suppose:
(i) P(no) is true
(ii) For all k > no, the truth of P(k) implies the truth of P(k +1). Take
any 22 No.
If n = no, then by (i) P(m) = P(no) is true.
If n> no, take n = no + 8, where s € {1,2,
If we show thnt P(n — h) is true for k = 1,2,3,...,2—no —1, then by (ii),
P(n) will be true.
I.
Define S={my+t: 1 4,n € N.
| Observe that 24 = 16 < 24 = 4! which gives us that the statement is true
for n= 4.
Assume that the statement is true for some k € N with k > 4. Then we
have that 2° < A! which gives us that 2+! = 2(2") < 2k!
Since 4 < k we have that 2 <5 < k +1 which gives us that
| 2k! < (k+ 1k! = (k +1)!
Thus, 2*+1 = 2(2) < 2k! < (k+1)! and therefore, the statement is true for
n=k+1.
Hence, the statement is true for all n > 4, 2 EN.
RESULT
HINT (for the bridge): 2*+! = 2(2*) < 2k! < (k+1)! Consider the statement 2n — 3 < 2"-? forn>5,nEN.
Observe that 2(5) -—3 = 10-3 = 7 <8 = 2% = 2° which gives us that the
statement is true for n = 5.
Assume that the statement is truc for some k € N with k > 5. Then we
have that 2k — 3 < 2*-? which gives us that 2(k + 1)—3 = 2k+2-3=
(2k —3)+2< 2k? 42.
Observe now that since 5 < k we have that 3 < &k — 2 which gives us that
2 <8 = 2% < 2? and therefore 24? +2 < 2h? 4 2k? = aah?) =
gk-2+1 _ o(k+1)-2,
Thus, 2(k +1) —3 < 2&2 4.2 < 2640-2 which gives us that 2(k4+1)-3.<
2tk+1)-2 and therefore, the statement is true for n = k +1.
Hence, the statement is true for all n > 5, n € N.
RESULT €
HINT (for the bridge): 2(k +1) —3< 2k-2 4.9 < gtk+1)-2
| Observe that
2=1<2=2!,
2=4=22,
3? =9>8=23,
4 = 16=2!,
5? = 25 < 32 =25,
6? = 36 < 64 = 25,
7 = 49 < 128 = 2" and
8? = G4 < 256 = 28.
Thus, we can conjecture that n? < 2" for n = 1 and for all n > 5.
Let’s prove our conjecture!
Consider the statement n? < 2” for all n > 5.
Since 5? = 25 < 32 = 2° we have that the statement is true for n =5.
Assume the statement is true for some k € N with k > 5. Then we have
that k? < 2" which gives us that 2h? < 2(2*) = Qk+1,
Since 5 < k we have that 4 < k —1 which gives us that
2<16=4? < (k—1)? =k? -2k41,
Thus, 2 < k? — 2k +1 and then 2k +1 < k? which gives us that
k? 42k +1 < 2k? and therefore (k 4+ 1)? < 2k*.
Then, we have that (k +1)? < 2k? < 2(2*) = 2*+! and therefore the
statement is true for n = k+1. | Then, we have that (k + 1)? < 2k? < 2(2k) = okt
and therefore the
statement is true for n = k +1,
Hence, n? < 2" for alln > 5.
Thus, since 17 = 1 < 2 = 2! we have that our conjecture is true.
RESULT
n>5
Prove this statement using Mathematical Induction. 1 QS
Suppose m divides n? —n, Yn EN. Factorizing the expression we get
m|n?—n=>m| n(n - 1)
+m |n(n—1)(n+1), YneN (+)
Since this holds for all n N, lets see what property does m have for n = 2.
n=2, m[n(n—1)(n+1) = m|2-3-1=6
= m|6
Because m divides 6, m must be less than or equal to 6. Therefore, possible
choices for m are:
m=1, 2, 3,6
m = | satisfies (x) trivially, but we are looking for the Inrgest possible m. |
Note that n is either even or odd.
If nis even, then 2 divides 1, so it also divides n(n + 1)(n— 1).
If n is odd, then n +1 is even, so 2 divides n+ 1 and consequently,
n(n +1)(n—1). Therefore, m = 2 also satisties (+). |
There are three possible cases for n when dividing by 3. If n = 3k, for
some k EN, then 3| n => 3| n(n —1)(n+ 1).
If 1, for some k EN, then n-+1 = 3k = 3|n+1 > 3 | n(n+1)(n—1)
If n = 3k —2, for some k EN, then n — 1 = 3k —3 = 3(k—1) 33] n—1>
3| n(n +1)(n 1).
Therefore, m = 3 also satisfies (+).
We now have that
2|n(n+1)(n—1) WweN
3|n(n+1)(n—1) Yn eN
2-3 n(n+1)(n—-1) Yn eN
=([6]n@i+ Din—1) YneN
Therefore, m = 6 also satisfies (*). Since m < 6, [im =6) is the largest
possible m that satisfies (+).
RESULT
m=6
Clearly m < 6 because m must divide 6 (because 2° - 2 = 6). We prove
that m = 6 truly divides n® —n for all n € N by Mathematical Induction. Base of induction (n = 1):
Induction step:
Suppose 4 + Jp +...+ Jy 2 vii, for some n EN, n> 2.
>Vii by assumption
‘Therefore, we have proved the inequality for n + 1.
By principle of mathematical induction,
2444.4 42 va men
al-
RESULT
HINT (for the bridge):
vi
Vii by assumption Let S CN with properties:
(a) * € S,VkeN
(b) ke S,k>2>k-1ES
S CN soit remains to show NC S.
a) ‘SteesSics
Let nE Nn > 2.
If n= 2*, for some k EN, then n € S by a).
Ifn 4 2*, vk EN, then there exists ky € N such that n < 2",
Define T = {m EN: m < 2}. We'll prove that TC S by Principle of
Strong Induction.
Base of the induction:
m= 2" —1€ S because of a) and b)
Induction step:
Assume that {2 — 1,2 —2,...24 —h} CS.
Then 24 — ky — 1 = (2 — ky) -1 € S by b).
,
es
Therefore, TC S>SneTCS=>
RESULT
HINT: you only need to show that NCS. | yal
t=2
1
Ty2 = 5(tny1 + An) MEN N22
For n = 1,2 the property 1 < 2, < 2 is satisfied by definition.
Let n € N, n > 2. Suppose 1 < ay, <2, k=1,2....,n-1.
1 1
(1) tn = x(a +2) 2 (1+ 1) =1 |
(x; > 1 by assumption, k 2. Suppose 1 < 2%, <2, k=1,2....,n-1.
1 1
(1) an = pret +an-2) > Bl +1)=1
sie > 1 by assumption, k b-acP ie. b-a>0 (i)
e bt d-(atcleP > atccb+d
2 @
Part b)
Suppose 0 0
we get
O 0 then we have strict inequalities, but in case of ¢ = 0, ae =
Slmilarly, multiplying € Owe get
te 0. By Tichotomy Property a #0 s0 + exists
14 =0, then 1=a-2= 0-0 =0 +4 (Coutradietion with M3)
If} <0, then 1 = a4 <0 by Theorem 2.1.7 c), Contradiction with 1 > 0.
‘Therefore, £ > 0.
so a= + beemuse the multiplicative verse is unique (Theorem 2.1.3 n)).
2 \ 2
b) Suppose a 0 = } > 0 we have
a0, b>0=Sab>0
=> —>0
RESULT
HINTS:
(a) a? =a-a < ab, which yields the inequality a < Yab. Similarly, b > Vab.
(b) a>0.b>0=-ab>0=> < > 0. Multiply the inequality a < b by
1
a 1:00 atl Fl gis @D
SLADER Q =
Ex.
167
31
Dorotea 50% 1@
1
a) 2? > Sr 44 eo 2? Br—4 > 0 (2+ 1)[e—4) > 0 We have two
possibilities:
erpt>02-4>042>-1,2>45[2>4]
ert1<0,2-4<042<-1,2<45[Re-1
+1) U (4,00)
b) l © € (-2,-1) U (1,2)
3
°)
Ly —nil+2) <0
eluent
Itz>0, then
Au-anisyeowgeenieed AW etwas!
Itz<0, then
Lacie) 0 EP" pe >0ee>-1
‘Therefore, the solution is
2 €(-1,0)U (1,0)
Oo Oo g d)
\ 1eei_2eo
° i
# >(1-2") <0
If z > 0, then
F125) <0@1-2*<0ea>1e2>1
t>0Ar>1ls>r>1 \Z)
If « <0, then
L(1-2)<0@1-2 >0ea8z2r<0
Therefore, the solution is
x € (—00,0) U (1, 00)
RESULT
a) x € (—o0, —1) U (4, co)
b) x € (—2,—1) U (1, 2)
c) x € (-1,0) U (1, )
a) x € (—co, 0) U (1, co) 1:05 .
SLADER Q =
Co
Wy
@ Daniel Souza 43% 0@
Let a € & be such that 0 0.
Suppose a #0. Then, since 0 < awe must have 0 < a which gives us that
0<5
‘Thus, taking
5 we have that «= 0.
Hence, a= 0,
RESULT
HINT: assume a # 0, then a > 0, and take ¢ =
‘contradiction,
-. Argue that this leads to
2
Enter yourcomment here *
We have textbooks in many subjects. Find yours
| Q. Search textbooks
O oO g 463
1:06 wil Hl bis
Solutions to Intro... :
x @ slader.com a< i
Ex 30
18 ~
@ Daniel Souza 49% 0®@
Let a, € R, and suppose that for every €>0,aSb+«
Suppose that
19+ [eo Es
Dorotea 5.0% 0®@
7 @
[foray] shore hen [eon]
oro] Heavy Loar
a ete) det 2
gla? +B) — (a? + 2ab + b°)
Vey oy tat Jantar
= Hat 4 8) 300
T
= Noe a Fatt)
a dat nab +
Nat b+ 8)
= Nowe zo
Therefore, we have proven the inequality. Renins to show when equality
holds,
42404) [e+] = 049 4a-0 =
3 +8) [i +9] =o Ha-W?=0
oa-b=0
RESULT
HINT:
2
de? +0) [ie +o] = ha-Ht20
O oO gq 1:09 allie
a)
Lets define function g as 9(2) = f(x) —2 for 2 € [0,1], Observe thet 9 is
continiotts on closed interval [0,1] and dilferentiable on interval (0,1).
We have:
(0) = {(0) =0
a) =J0)~
a
(0) = g(1) =0
Now, by Theorem 6.2.3. Rolle’s Theorem we ca conclude that there exists
8 point cr € (0,1) such that g(e1) = 0
g(a) =0
4a
MMe)-1=0
f(a)y=1
2
»)
Lets define function g as o(21
continious on closed interval (1,2) and diferent
We have:
Slz)=1 for x € [1,2]. Observe that 9 is
Je om interval (1,2)
a1)
(2)
y
(0) = 9(2) =0
Now, by Theorem 6.2.3. Rolle's Theorem we can conclude that there exists
1 point oy € (1,2) such that ¢/(e2) = 0
ge) =0
u
SF'(c2) =0
3
°)
Frown a) and b) we know that f is differentiable on fe1,co] and that f*(c1) =
1, f'(c2) =0.
Observe that 4 is between f'(e1) and f"(ca).
Now. by thcorem 6.2.12, Darboux’s Theorem we can conclude that there
ists a point © € (ca) © (0,2) stich that J”(e) = 4
Oo Oo g 1:10 ol tle @D
< Ex. > | *RO |
19~ a
Dorotea 50% 0®@
2 @
Let ¢> 0 rbiteary. Since J is uniformly liferentinble, there exits 5> 0
such that if 0 < |e—y] <6, then b— pa)