Solution Manual for Analysis with an

Introduction to Proof 5th Edition Lay

032174747X 9780321747471
Go to download the full and correct content document:
https://testbankpack.com/download/solution-manual-for-analysis-with-an-introduction-
to-proof-5th-edition-lay-032174747x-9780321747471/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Solution Manual for Introduction to Statistics and Data

Analysis 5th Edition Peck 1305115341 9781305267244

https://testbankpack.com/download/solution-manual-for-
introduction-to-statistics-and-data-analysis-5th-edition-
peck-1305115341-9781305267244/

Test Bank for Introduction to Statistics and Data

Analysis 5th Edition Peck 1305115341 9781305267244

https://testbankpack.com/download/test-bank-for-introduction-to-
statistics-and-data-analysis-5th-edition-
peck-1305115341-9781305267244/

Solution Manual for Introduction to Analysis 4th

Edition Wade 0132296381 9780132296380

https://testbankpack.com/download/solution-manual-for-
introduction-to-analysis-4th-edition-
wade-0132296381-9780132296380/

Solution Manual for Introduction to Analysis Classic

4th Edition Wade 9780134707624

https://testbankpack.com/download/solution-manual-for-
introduction-to-analysis-classic-4th-edition-wade-9780134707624/
Solution Manual for Engineering Fundamentals An
Introduction to Engineering 5th edition by Saeed
Moaveni ISBN 1305084764 9781305084766

https://testbankpack.com/download/solution-manual-for-
engineering-fundamentals-an-introduction-to-engineering-5th-
edition-by-saeed-moaveni-isbn-1305084764-9781305084766/

Solution Manual for Introduction to Engineering

Analysis 4th Edition Hagen 0133485080 9780133485080

https://testbankpack.com/download/solution-manual-for-
introduction-to-engineering-analysis-4th-edition-
hagen-0133485080-9780133485080/

Solution Manual for Engineering Fundamentals An

Introduction to Engineering SI Edition 5th edition by
Saeed Moaveni ISBN 1305105729 9781305105720

https://testbankpack.com/download/solution-manual-for-
engineering-fundamentals-an-introduction-to-engineering-si-
edition-5th-edition-by-saeed-moaveni-
isbn-1305105729-9781305105720/

Solution Manual for Introduction to Management Science

A Modeling and Case Studies Approach with Spreadsheets
5th Edition Hillier 0078024064 9780078024061

https://testbankpack.com/download/solution-manual-for-
introduction-to-management-science-a-modeling-and-case-studies-
approach-with-spreadsheets-5th-edition-
hillier-0078024064-9780078024061/

Solution Manual for Close Relations An Introduction to

the Sociology of Families Canadian 5th Edition by
McDaniel ISBN 0132895595 9780132895590

https://testbankpack.com/download/solution-manual-for-close-
relations-an-introduction-to-the-sociology-of-families-
canadian-5th-edition-by-mcdaniel-isbn-0132895595-9780132895590/
Solution Manual for Analysis with an Introduction to Proof 5th
Edition Lay 032174747X 9780321747471
Full Link Download:
Solution Manual:
https://testbankpack.com/p/solution-manual-for-analysis-with-an-
introduction-to-proof-5th-edition-lay-032174747x-9780321747471/
Instructor’s Solutions Manual
to accompany

ANALYSIS
with an Introduction
to Proof
5th Edition

Steven R. Lay
Lee University

 &RS\ULJKW 3HDUVRQ (GXFDWLRQ ,QF

Upper Saddle River, New Jersey 07458

Copyright © 2014 Pearson Education, Inc.

 2

This manual is intended to accompany the 5th edition of Analysis with an Introduction to Proof
by Steven R. Lay (Pearson, 2013). It contains solutions to nearly every exercise in the text. Those
exercises that have hints (or answers) in the back of the book are numbered in bold print, and the hints
are included here for reference. While many of the proofs have been given in full detail, some of the
more routine proofs are only outlines. For some of the problems, other approaches may be equally
acceptable. This is particularly true for those problems requesting a counterexample. I have not tried
to be exhaustive in discussing each exercise, but rather to be suggestive.
Let me remind you that the starred exercises are not necessarily the more difficult ones. They
are the exercises that are used in some way in subsequent sections. There is a table on page 3 that
indicates where starred exercises are used later. The following notations are used throughout this
manual:
N = the set of natural numbers {1, 2, 3, 4, …}
Q = the set of rational numbers
= the set of real numbers
 = "for every"
 = "there exists"
† = "such that"
I have tried to be accurate in the preparation of this manual. Undoubtedly, however, some
mistakes will inadvertently slip by. I would appreciate having any errors in this manual or the text
brought to my attention.

Steven R. Lay
slay@leeuniversity.edu

Copyright © 2014 Pearson Education, Inc.

 3

Table of Starred Exercises

Note: The prefix P indicates a practice problem, the prefix E indicates an example, the prefix T refers to a
theorem or corollary, and the absence of a prefix before a number indicates an exercise.

Starred Starred
Exercise Later Use Exercise Later use
2.1.26 T3.4.11 4.3.14 4.4.5
2.2.10 2.4.26 4.4.10 8.2.14
2.3.32 2.5.3 4.4.16 8.3.9
3.1.3 E7.1.7 4.4.17 T8.3.3
3.1.4 7.1.7 5.1.14 6.2.8
3.1.6 E8.1.1 5.1.16 T6.2.9
3.1.7 4.3.10, 4.3.15, E8.1.7, T9.2.9 5.1.18 5.2.14, 5.3.15
3.1.8 P8.1.3 5.1.19 5.2.17
3.1.24 4.1.7f, E5.3.7 5.2.10 T7.2.8
3.1.27 3.3.14 5.2.11 7.2.9b
3.1.30b 3.3.11, E4.1.11, 4.3.14 5.2.13 T5.3.5, T6.1.7, 7.1.13
3.2.6a 4.1.9a, T4.2.1, 6.2.23, 7.2.16, T9.2.9 5.2.16 9.2.15
3.2.6b T6.3.8 5.3.13b T6.2.8, T6.2.10
3.2.6c T4.1.14 6.1.6 6. 2.14, 6.2.19
3.2.7 T8.2.5 6.1.8 7.3.13
3.3.7 T7.2.4, 7.2.3 6.1.17b 6.4.9
3.3.12 7.1.14, T7.2.4 6.2.8 T7.2.1
3.4.15 3.5.12, T4.3.12 6.3.13d 9.3.16
3.4.21 3.5.7 7.1.12 P7.2.5
3.5.8 9.2.15 7.1.13 7.2.5
3.6.12 5.5.9 7.1.16 7.2.17
4.1.6b E4.2.2 7.2.9a P7.3.7
4.1.7f T4.2.7, 4.3.10, E8.1.7 7.2.11 T8.2.13
4.1.9a 5.2.10, 9.2.17 7.2.15 7.3.20
4.1.11 E4.3.4 7.2.20 E7.3.9
4.1.12 5.1.15 8.1.7 E8.2.6
4.1.13 5.1.13 8.1.8 8.2.13
4.1.15b 4.4.11, 4.4.18, 5.3.12 8.1.13a 9.3.8
4.1.16 5.1.15 8.2.12 9.2.7, 9.2.8
4.2.17 E6.4.3 8.2.14 T8.3.4
4.2.18 5.1.14, T9.1.10 9.1.15a 9.2.9

Copyright © 2014 Pearson Education, Inc.

 Section 1.1  Logical Connectives 4

This work is protected by United States copyright laws and is provided solely for
the use of instructors in teaching their courses and assessing student learning.
Dissemination or sale of any part of this work (including on the World Wide Web)
will destroy the integrity of the work and is not permitted. The work and materials
from it should never be made available to students except by instructors using
the accompanying text in their classes. All recipients of this work are expected to
abide by these restrictions and to honor the intended pedagogical purposes and
the needs of other instructors who rely on these materials.

Analysis
with an Introduction to Proof
5th Edition

by Steven R. Lay
slay@leeuniversity.edu

Chapter 1 – Logic and Proof

Solutions to Exercises

Section 1.1 – Logical Connectives

1. (a) False: A statement may be false.

(b) False: A statement cannot be both true and false.
(c) True: See the comment after Practice 1.1.4.
(d) False: See the comment before Example 1.1.3.
(e) False: If the statement is false, then its negation is true.

2. (a) False: p is the antecedent.

(b) True: Practice 1.1.6(a).
(c) False: See the paragraph before Practice 1.1.5.
(d) False: "p whenever q" is "if q, then p".
(e) False: The negation of p º q is p  ~ q.

3. Answers in Book: (a) The 3 × 3 identity matrix is not singular.

(b) The function f (x) = sin x is not bounded on .
(c) The function f is not linear or the function g is not linear.
(d) Six is not prime and seven is not odd.
(e) x is in D and f (x)  5.

Copyright © 2014 Pearson Education, Inc.

 Section 1.1  Logical Connectives 5
(f) (an) is monotone and bounded, but (an) is not convergent.
(g) f is injective, and S is not finite and not denumerable.

4. (a) The function f (x) = x2 – 9 is not continuous at x =

3. (b) The relation R is not reflexive and not symmetric.
(c) Four and nine are not relatively prime.
(d) x is not in A and x is in B.
(e) x < 7 and f (x) is in C.
(f ) (an) is convergent, but (an) is not monotone or not bounded.
(g) f is continuous and A is open, but f – 1(A) is not open.

5. Answers in book: (a) Antecedent: M is singular; consequent: M has a zero eigenvalue.

(b) Antecedent: linearity; consequent: continuity.
(c) Antecedent: a sequence is Cauchy; consequent: it is bounded.
(d) Antecedent: y > 5; consequent: x < 3.

6. (a) Antecedent: it is Cauchy; consequent: a sequence is convergent.

(b) Antecedent: boundedness; consequent: convergence.
(c) Antecedent: orthogonality; consequent: invertability.
(d) Antecedent: K is closed and bounded; consequent: K is compact.

7 and 8 are routine.

9. Answers in book: (a) T  T is T. (b) F  T is T. (c) F  F is F. (d) T º T is T. (e) F º F is T.

(f) T º F is F. (g) (T  F) º T is T. (h) (T  F) º F is F. (i) (T  F) º F is T. (j) ~ (F  T) is F.

10. (a) T  F is F. (b) F  F is F. (c) F  T is T. (d) T º F is F. (e) F º F is T. (f) F º T is T. (g)

(F  T) º F is F. (h) (T º F) º T is T. (i) (T  T) º F is F. (j) ~ (F  T) is T.

11. Answers in book: (a) p  ~ q; (b) ( p  q)  ~ ( p  q); (c) ~ q º p; (d) ~ p º q; (e) p ” ~ q.

12. (a) n  ~ m; (b) ~ m  ~ n or ~ (m  n); (c) n º m; (d) m º ~ n; (e) ~ (m  n).

13. (a) and (b) are routine. (c) p  q.

14. These truth tables are all straightforward. Note that the tables for (c) through (f) have 8 rows because there are 3
letters and therefore 23 = 8 possible combinations of T and F.

Section 1.2 - Quantifiers

1. (a) True: See the comment before Example 1.2.1.

(b) False: The negation of a universal statement is an existential statement.
(c) True: See the comment before Example 1.2.1.

2. (a) False: It means there exists at least one.

(b) True: Example 1.2.1.
(c) True: See the comment after Practice 1.2.4.

3. (a) No pencils are red.

(b) Some chair does not have four legs.
(c) Someone on the basketball team is over 6 feet 4 inches tall.
(d)  x > 2, f (x)  7.

Copyright © 2014 Pearson Education, Inc.

 Section 1.2  Quantifiers 6
(e)  x in A †  y > 2, f ( y)  0 or f ( y)  f (x).
(f)  x † x > 3 and   > 0, x2 ” 9 + .

4. (a) Someone does not like Robert.

(b) No students work part-time.
(c) Some square matrices are triangular.
(d)  x in B, f (x) ” k.
(e)  x † x > 5 and 3  f (x)  7.
(f)  x in A †  y in B, f (y) ” f (x).

5. Hints in book: The True/False part of the answers.

(a) True. Let x = 3. (b) True. 4 is less than 7 and anything smaller than 4 will also be less than 7.
(c) True. Let x = 5. (d) False. Choose x   5 such as x = 2.
(e) True. Let x = 1, or any other real number.

(f) True. The square of a real number cannot be negative.

(g) True. Let x = 1, or any real number other than 0. (h) False. Let x = 0.
6. (a) True. Let x = 5. (b) False. Let x = 3. (c) True. Choose x   3 such as x = 2.

(d) False. Let x = 3. (e) False. The square of a real number cannot be negative.
(f) False. Let x = 1, or any other real number. (g) True. Let x = 1, or any other real number.
(h) True. x – x = x + (– x) and a number plus its additive inverse is zero.

7. Answers in book: (a) You can use (ii) to prove (a) is true. (b) You can use (i) to prove (b) is true.
Additional answers: (c) You can use (ii) to prove (c) is false. (d) You can use (i) to prove (d) is false.

8. The best answer is (c).

9. Hints in book: The True/False part of the answers.

(a) False. For example, let x = 2 and y = 1. Then x > y.
(b) True. For example, let x = 2 and y = 3. Then x ” y.
(c) True. Given any x, let y = x + 1. Then x ” y.
(d) False. Given any y, let x = y + 1. Then x > y.

10. (a) True. Given any x, let y = 0.

(b) False. Let x = 0. Then for all y we have xy = 0  1.
(c) False. Let y = 0. Then for all x we have xy = 0  1.
(d) True. Given any x, let y = 1. Then xy = x.

11. Hints in book: The True/False part of the answers.

(a) True. Let x = 0. Then given any y, let z = y. (A similar argument works for any x.)
(b) False. Given any x and any y, let z = x + y + 1.
(c) True. Let z = y – x.
(d) False. Let x = 0 and y = 1. (It is a true statement for x  0.)
(e) True. Let x  0.
(f) True. Take z  y. This makes "z  y " false so that the implication is true. Or, choose z  x + y.

12. (a) True. Given x and y, let z = x + y.

(b) False. Let x = 0. Then given any y, let z = y + 1.
(c) True. Let x = 1. Then given any y, let z = y. (Any x  0 will work.)
(d) False. Let x = 1 and y = 0. (Any x  0 will work.)
(e) False. Let x = 2. Given any y, let z = y + 1. Then "z  y " is true, but "z  x + y " is false.
(f) True. Given any x and y, either choose z  x + y or z  y.

Copyright © 2014 Pearson Education, Inc.

 Section 1.2  Quantifiers 7
13. Answer in book: (a)  x, f (x) = f (x); (b)  x 5 f (x)  f (x).

14. (a)  k  0 5  x, f (x + k) = f (x). (b)  k  0,  x 5 f (x + k)  f (x).

15. Answer in book: (a)  x and y, x  y = f (x)  f ( y). (b)  x and y 5 x  y and f (x) > f ( y).

16. (a)  x and y, x  y = f (x)  f ( y). (b)  x and y 5 x  y and f (x)  f ( y).

17. Answer in book: (a)  x and y, f (x) = f ( y) = x = y. (b)  x and y 5 f (x) = f ( y) and x  y.

18. (a)  y in B  x in A 5 f (x) = y. (b)  y in B 5  x in A, f (x)  y.

19. Answer in book: (a)    0,    0 5  x  D, ] x  c]   = ] f (x)  f (c)]  .

(b)    0 5    0,  x  D 5 ] x  c ] <  and ] f (x)  f (c)]  .

20. (a)    0    0 5  x and y in S, ] x - y ]   = ] f (x) - f ( y) ]  € .

(b)  €  0 5  6  0,  x and y in S 5 ] x - y ]  6 and ] f (x) - f ( y) ]  € .

21. Answer in book: (a)    0,    0 5  x  D, 0  ] x  c]   = ] f (x)  L]  .

(b)    0 5    0,  x  D 5 0  ] x  c]   and ] f (x)  L]  .

22. Answers will vary.

Section 1.3 – Techniques of Proof: I

1. (a) False: p is the hypothesis. (b) False: The contrapositive is ~ q = ~

p. (c) False: The inverse is ~ p = ~ q. (d) False: p(n) must be true for all n.
(e) True: Example 1.3.1.

2. (a) True: See the comment after Practice 1.3.4. (b) False: It’s called a contradiction.
(c) True: See the comment after Practice 1.3.8. (d) True: See the end of Example 1.3.1.
(e) False: Must show p(n) is true for all n.

3. Answers in book: (a) If all violets are not blue, then some roses are not red.
(b) If A is invertible, then there is no nontrivial solution to Ax = 0.
(c) If f (C) is not connected, then either f is not continuous or C is not connected.

4. (a) If some violets are blue, then all roses are red.
(b) If A is not invertible, then there exists a nontrivial solution to Ax = 0.
(c) If f (C) is connected, then f is continuous and C is connected.

5. (a) If some roses are not red, then no violets are blue.
(b) If Ax = 0 has no nontrivial solutions, then A is invertible.
(c) If f is not continuous or C is not connected, then f (C) is not connected.

6. For some of these, other answers are possible.

(a) Let x = - 4. (b) Let n = 2.
(c) If 0  x  1, then x  x . In particular, (1/2) = 1/8 < 1/4 = (1/2) .
3 2 3 2

(d) An equilateral triangle. (e) n = 40 or n = 41.

(f) 2 is prime, but not odd. (g) 101, 103, etc.
5
(h) 3 + 2 = 245 is not prime. (i) Let n = 5 or any odd greater than 3.
(j) Let x = 2 and y = 18. (k) Let x = 0.
( l) The reciprocal of 1 is not less than 1. (m) Let x = 0.
(n) Let x = 1.

Copyright © 2014 Pearson Education, Inc.

 Section 1.3  Techniques of Proof: I 8
7. (a) Suppose p = 2k + 1 and q = 2r + 1 for integers k and r. Then p + q = (2k + 1) + (2r + 1) = 2(k + r + 1), so
p + q is even.
(b) Suppose p = 2k + 1 and q = 2r + 1 for integers k and r. Then pq = (2k + 1)(2r + 1) = 4kr + 2k + 2r + 1 =
2(2kr + k + r) + 1, so pq is odd.
(c) Here are two approaches. The first mimics part (a) and the second uses parts (a) and (b).
Proof 1: Suppose p = 2k + 1 and q = 2r + 1 for integers k and r. Then p + 3q = (2k + 1) + 3(2r + 1) =
2(k + 3r + 2), so p + 3q is even.
Proof 2: Suppose p and q are both odd. By part (b), 3q is odd since 3 is odd. So by part (a), p + 3q is even.
(d) Suppose p = 2k + 1 and q = 2r for integers k and r. Then p + q = (2k + 1) + 2r = 2(k + r) + 1, so p + q is odd.
(e) Suppose p = 2k and q = 2r for integers k and r. Then p + q = 2k + 2r = 2(k + r), so p + q is even.
(f) Suppose p = 2k, then pq = 2(kq), so pq is even. A similar argument applies when q is even.
(g) This is the contrapositive of part (f).
(h) Hint in book: look at the contrapositive.
Proof: To prove the contrapositive, suppose p = 2k + 1. Then p2 = (2k + 1)2 = 4k2 + 4k + 1 =
2(2k2 + 2k) + 1, so p2 is odd.
(i) To prove the contrapositive, suppose p = 2k. Then p2 = (2k)2 = 4k2 = 2(2k2), so p2 is even.

8. Suppose f (x1) = f (x2). That is, 4x1 + 7 = 4x2 + 7. Then 4x1 = 4x2, so x1 = x2.

9. Answers in book:
(a) r=~s hypothesis
~s=~t contrapositive of hypothesis: 1.3.12(c)
r=~t by 1.3.12(l)
(b) ~ t = (~ r  ~ s) contrapositive of hypothesis: 1.3.12(c)
~r~s by 1.3.12(h)
~s by 1.3.12(j)
(c) r~r by 1.3.12(d)
~s=~v contrapositive of hypothesis 4 [1.3.12(c)]
r=~v hypothesis 1 and 1.3.12(l)
~r= u hypotheses 2 and 3 and 1.3.12(l)
~v u by 1.3.12(o)

10. (a) ~r hypothesis

~ r = (r  ~ s) contrapositive of hypothesis: 1.3.12(c)
r  ~s by 1.3.12(h)
~s by lines 1 and 3, and 1.3.12(j)
(b) ~t hypothesis
~ t = (~ r  ~ s) contrapositive of hypothesis: 1.3.12(c)
~r  ~s by lines 1 and 2, and 1.3.12(h)
~s by line 3 and 1.3.12(k)
(c) s=r contrapositive of hypothesis: 1.3.12(c)
t=u hypothesis
s t hypothesis
r u by 1.3.12(o)

Copyright © 2014 Pearson Education, Inc.

 Section 1.3  Techniques of Proof: I 9
11. Let p: The basketball center is healthy. q: The point guard is hot.
r: The team will win. s: The fans are happy.
t: The coach is a millionaire. u: The college will balance the budget.
The hypotheses are ( p  q) = (r  s) and (s  t) = u. The conclusion is p = u.
Proof: p = ( p  q) from the contrapositive of
1.3.12(k) ( p  q) = (r  s) hypothesis
(r  s) = s by 1.3.12(k)
s = (s  t) from the contrapositive of 1.3.12(k)
(s  t) = u hypothesis
p=u by 1.3.12(m)

Section 1.4 – Techniques of Proof: II

1. (a) True: See the comment before Example 1.4.1.

(b) False: Indirect proofs avoid this.
(c) False: Only the "relevant" steps need to be included.

2. (a) True: See the comment before Practice 1.4.2.

(b) False: The left side of the tautology should be [(p  ~ q) = c].
(c) True: See the comment after Practice 1.4.8.

3. Given any  > 0, let  =  /3. Then  is also positive and whenever 2 -  < x < 2 + , we have 2   x  2  so
3 3
that 6 -  < 3x < 6 +  and 11 -  < 3x + 5 < 11 + , as required.
 
4. Given any  > 0, let  =  /5. Then  is also positive and whenever 1 -  < x < 1 + , we have 1  x  1 so
5 5
that 5 -  < 5x < 5 +  and -2 -  < 5x - 7 < -2 + . Now multiply by -1 and reverse the inequalities: 2 +  >
7 - 5x > 2 - . This is equivalent to 2 -  < 7 - 5x < 2 + .
5. Let x = 1. Then for any real number y, we have xy = y.
6. Let x = 0. Then for any real number y, we have xy = x because xy = 0.
2 3 2 2
7. Given any integer n, we have n + n = n (1 + n). If n is even, then n is even. If n is odd, then 1 + n is even. In
either case, their product is even. [This uses Exercise 1.3.7(f).]
2 2 2
8. If n is odd, then n = 2m + 1 for some integer m, so n = (2m + 1) = 4m + 4m + 1 = 4m(m + 1) + 1. If m is even,
then m = 2p for some integer p. But then n2 = 4(2p)(m + 1) + 1 = 8[p(m + 1)] + 1. So n2 = 8k + 1, where k is the
integer p(m + 1). On the other hand, if m is odd, then m + 1 is even and m + 1 = 2q for some integer q. But then,
n2 = 4m(2q) + 1 = 8(mq) + 1. In this case, n2 = 8k + 1, where k is the integer mq. In either case, n2 = 8k + 1 for
some integer k.
3  3
9. Answer in book: Let n 2. Then n 2  n 4   (2) 4  3 1, as required. The integer is unique.
2 
2 
10. Existence follows from Exercise 3. It is not unique. x = 2 or x = 1/2.

11. Answer in book: Let x be a real number greater than 5 and let y = 3x/(5  x). Then 5  x  0 and 2x  0, so y  0.
 3x 
5 
5y  5 x  15 x 15x
Furthermore, x, as required.
y3  3x   3 3x  3(5  x) 15
 
5 x 


Copyright © 2014 Pearson Education, Inc.

 Section 1.4  Techniques of Proof: II 10
12. Solve the quadratic y2 - 6xy + 9 = 0 to obtain y 3x  3 x 2 1. Call one solution y and the other z. The proof is
organized like Exercise 11.

13. Answer in book: Suppose that x2  x  6  0 and x  3. It follows that (x  2)(x  3)  0 and, since x  3  0, it
must be that x  2  0. That is, x  2.
x
14. Suppose  3 and x  2. Then x - 2 > 0, so we can multiply both sides of the first inequality by x - 2 to
x2
x
obtain x  3(x - 2). Thus x  3x - 6. That is, x  3. If x = 2, then is not defined.
x2
15. Hint in book: Suppose log 2 7 is rational and find a contradiction.
a/b
Proof: Suppose log 2 7 = a/b, where a and b are integers. We may assume that a > 0 and b > 0. We have 2 = 7,

a b a b
which implies 2 = 7 . But the number 2 is even and the number 7 is odd, a contradiction. Thus log 2 7 must be
irrational.

16. Suppose ] x + 1 ]  3 and consider the two cases: x  -1 and x  -1. If x • -1, then x + 1 • 0 so that ]x + 1] = x + 1.
This implies x + 1 ” 3 and x ” 2. So in this case we have -1 ” x ” 2.
On the other hand, if x < -1, then x + 1 < 0 and ]x + 1] = - (x + 1). This leads to - (x + 1) ” 3, x + 1 • - 3, and
x • - 4. In this case we have - 4 ” x < -1.
Combining the two cases, we get - 4 ” x ” 2.

17. (a) This proves the converse, which is not a valid proof of the original implication.
(b) This is a valid proof using the contrapositive.

18. (a) This is a valid proof in the form of Example 1.3.12 ( p): [ p = (q  r)] ” [( p  ~ q) = r].
(b) This proves the converse, which is not a valid proof of the original implication.
p p pn qm
19. (a) If x and y m, then x  y m , so x + y is rational.
q n q n qn
p m, pm
(b) If x q and y n then xy qn , so xy is rational.

(c) Hint in book: Use a proof by contradiction.

p .
Proof: Suppose x q , y is irrational, and suppose x  y rs Then

r p rq ps
( x  y)  x ,
y sq qs

so that y is rational, a contradiction. Thus x + y must be irrational.

20. (a) False. For example, let x = 2 and y =  2 . Then x + y = 0.

(b) True. This is the contrapositive of Exercise 7(a).

(c) False. For example, let x = y = 2 . Then xy = 2.
(d) True. This is the contrapositive of Exercise 13(b).
21. (a) Let x = 0 and y 2 . Then xy = 0.
xy
(b) y  x when x = 0.

(c) If x  0, then the conclusion is true.

Copyright © 2014 Pearson Education, Inc.

 Section 1.4  Techniques of Proof: II 11

22. It is false as stated, and a counterexample is x =  2 . Since x is negative, it’s square root is not real, and hence

not irrational. (Every irrational number is a real number.) If x  0, then the result is true, and can be established by
looking at the contrapositive. (In order to use the contrapositive, you have to know that the negation of " x is
irrational" is " x is rational." This is only true if you know that x is a real number.)

23. Hint in book: Find a counterexample.

Solution: 62 + 82 = 102 or (2)2 + 02 = 22.

24. If a, b, c are consecutive odd integers, then a = 2k + 1, b = 2k + 3, and c = 2k + 5 for some integer k. Suppose
a2 + b2 = c2. Then (2k + 1)2 + (2k + 3)2 = (2k + 5)2. Whence 4k2 - 4k - 15 = 0 and k = 5/2 or k = 3/2. This
contradicts k being an integer.

25. It is true. We may label the numbers as n, n + 1, n + 2, n + 3, and n + 4. We have the sum
S = n + (n + 1) + (n + 2) + (n + 3) + (n + 4) = 5n + 10 = 5(n + 2),
so that S is divisible by 5.

26. It is true. We may label the numbers as n, n + 1, n + 2, and n + 3. We have the sum
S = n + (n + 1) + (n + 2) + (n + 3) = 4n + 6 = 2(2n + 3).
Since 2n + 3 is odd, S is not divisible by 4.

27. Hint in book: Consider two cases depending on whether n is odd or even.
Proof: If n is odd, then n2 and 3n are both odd, so n2  3n is even. Thus n2  3n  8 is even. If n is even, then so are
n2, 3n, and n2  3n  8. (This uses Exercise 1.3.7.)

28. False. Let n = 1. Then n2  4n  8 = 13. Any other odd n will also work.
2
29. Hint in book: Let z = 2 . If z is rational, we are done. If z is irrational, look at z 2 .


 2  2
2
2  2 ( 2 2 ) 2
Solution: We have z 2 2.
 
 
30. Counterexample: let x = 1/3 and y = -8. Then (1/3) - 8 = 38 is a positive integer and (- 8)1/3 is a negative integer.

31. Suppose x  0. Then (x + 1)2 = x2 + 2x + 1  x2 + 1, so the first inequality holds. For the second inequality,
consider the difference 2(x2 + 1)  (x + 1)2. We have
2(x2 + 1)  (x + 1)2 = 2x2 + 2  x2  2x  1 = x2  2x + 1 = (x  1)2  0,
for all x, so the second inequality also holds.

Copyright © 2014 Pearson Education, Inc.

Another random document with
no related content on Scribd:
 PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg™ mission of promoting the free

distribution of electronic works, by using or distributing this work (or
any other work associated in any way with the phrase “Project
Gutenberg”), you agree to comply with all the terms of the Full
Project Gutenberg™ License available with this file or online at
www.gutenberg.org/license.

Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand, agree
to and accept all the terms of this license and intellectual property
(trademark/copyright) agreement. If you do not agree to abide by all
the terms of this agreement, you must cease using and return or
destroy all copies of Project Gutenberg™ electronic works in your
possession. If you paid a fee for obtaining a copy of or access to a
Project Gutenberg™ electronic work and you do not agree to be
bound by the terms of this agreement, you may obtain a refund from
the person or entity to whom you paid the fee as set forth in
paragraph 1.E.8.

1.B. “Project Gutenberg” is a registered trademark. It may only be

used on or associated in any way with an electronic work by people
who agree to be bound by the terms of this agreement. There are a
few things that you can do with most Project Gutenberg™ electronic
works even without complying with the full terms of this agreement.
See paragraph 1.C below. There are a lot of things you can do with
Project Gutenberg™ electronic works if you follow the terms of this
agreement and help preserve free future access to Project
Gutenberg™ electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright law in
the United States and you are located in the United States, we do
not claim a right to prevent you from copying, distributing,
performing, displaying or creating derivative works based on the
work as long as all references to Project Gutenberg are removed. Of
course, we hope that you will support the Project Gutenberg™
mission of promoting free access to electronic works by freely
sharing Project Gutenberg™ works in compliance with the terms of
this agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms of
this agreement by keeping this work in the same format with its
attached full Project Gutenberg™ License when you share it without
charge with others.

1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the terms
of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.

1.E. Unless you have removed all references to Project Gutenberg:

1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project Gutenberg™
work (any work on which the phrase “Project Gutenberg” appears, or
with which the phrase “Project Gutenberg” is associated) is
accessed, displayed, performed, viewed, copied or distributed:
 This eBook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this eBook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.

1.E.2. If an individual Project Gutenberg™ electronic work is derived

from texts not protected by U.S. copyright law (does not contain a
notice indicating that it is posted with permission of the copyright
holder), the work can be copied and distributed to anyone in the
United States without paying any fees or charges. If you are
redistributing or providing access to a work with the phrase “Project
Gutenberg” associated with or appearing on the work, you must
comply either with the requirements of paragraphs 1.E.1 through
1.E.7 or obtain permission for the use of the work and the Project
Gutenberg™ trademark as set forth in paragraphs 1.E.8 or 1.E.9.

1.E.3. If an individual Project Gutenberg™ electronic work is posted

with the permission of the copyright holder, your use and distribution
must comply with both paragraphs 1.E.1 through 1.E.7 and any
additional terms imposed by the copyright holder. Additional terms
will be linked to the Project Gutenberg™ License for all works posted
with the permission of the copyright holder found at the beginning of
this work.

1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files containing a
part of this work or any other work associated with Project
Gutenberg™.

1.E.5. Do not copy, display, perform, distribute or redistribute this

electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1 with
active links or immediate access to the full terms of the Project
Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if you
provide access to or distribute copies of a Project Gutenberg™ work
in a format other than “Plain Vanilla ASCII” or other format used in
the official version posted on the official Project Gutenberg™ website
(www.gutenberg.org), you must, at no additional cost, fee or expense
to the user, provide a copy, a means of exporting a copy, or a means
of obtaining a copy upon request, of the work in its original “Plain
Vanilla ASCII” or other form. Any alternate format must include the
full Project Gutenberg™ License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™ works
unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or providing

access to or distributing Project Gutenberg™ electronic works
provided that:

• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”

• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
 copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.

• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.

• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project Gutenberg™

electronic work or group of works on different terms than are set
forth in this agreement, you must obtain permission in writing from
the Project Gutenberg Literary Archive Foundation, the manager of
the Project Gutenberg™ trademark. Contact the Foundation as set
forth in Section 3 below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on, transcribe
and proofread works not protected by U.S. copyright law in creating
the Project Gutenberg™ collection. Despite these efforts, Project
Gutenberg™ electronic works, and the medium on which they may
be stored, may contain “Defects,” such as, but not limited to,
incomplete, inaccurate or corrupt data, transcription errors, a
copyright or other intellectual property infringement, a defective or
damaged disk or other medium, a computer virus, or computer
codes that damage or cannot be read by your equipment.

1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except

for the “Right of Replacement or Refund” described in paragraph
1.F.3, the Project Gutenberg Literary Archive Foundation, the owner
of the Project Gutenberg™ trademark, and any other party
distributing a Project Gutenberg™ electronic work under this
agreement, disclaim all liability to you for damages, costs and
expenses, including legal fees. YOU AGREE THAT YOU HAVE NO
REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF
WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE
PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE
FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.

1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you

discover a defect in this electronic work within 90 days of receiving it,
you can receive a refund of the money (if any) you paid for it by
sending a written explanation to the person you received the work
from. If you received the work on a physical medium, you must
return the medium with your written explanation. The person or entity
that provided you with the defective work may elect to provide a
replacement copy in lieu of a refund. If you received the work
electronically, the person or entity providing it to you may choose to
give you a second opportunity to receive the work electronically in
lieu of a refund. If the second copy is also defective, you may
demand a refund in writing without further opportunities to fix the
problem.

1.F.4. Except for the limited right of replacement or refund set forth in
paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO
OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of damages.
If any disclaimer or limitation set forth in this agreement violates the
law of the state applicable to this agreement, the agreement shall be
interpreted to make the maximum disclaimer or limitation permitted
by the applicable state law. The invalidity or unenforceability of any
provision of this agreement shall not void the remaining provisions.
1.F.6. INDEMNITY - You agree to indemnify and hold the
Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and distribution
of Project Gutenberg™ electronic works, harmless from all liability,
costs and expenses, including legal fees, that arise directly or
indirectly from any of the following which you do or cause to occur:
(a) distribution of this or any Project Gutenberg™ work, (b)
alteration, modification, or additions or deletions to any Project
Gutenberg™ work, and (c) any Defect you cause.

Section 2. Information about the Mission of

Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new computers.
It exists because of the efforts of hundreds of volunteers and
donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project Gutenberg™’s
goals and ensuring that the Project Gutenberg™ collection will
remain freely available for generations to come. In 2001, the Project
Gutenberg Literary Archive Foundation was created to provide a
secure and permanent future for Project Gutenberg™ and future
generations. To learn more about the Project Gutenberg Literary
Archive Foundation and how your efforts and donations can help,
see Sections 3 and 4 and the Foundation information page at
www.gutenberg.org.

Section 3. Information about the Project

Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-profit
501(c)(3) educational corporation organized under the laws of the
state of Mississippi and granted tax exempt status by the Internal
Revenue Service. The Foundation’s EIN or federal tax identification
number is 64-6221541. Contributions to the Project Gutenberg
Literary Archive Foundation are tax deductible to the full extent
permitted by U.S. federal laws and your state’s laws.

The Foundation’s business office is located at 809 North 1500 West,

Salt Lake City, UT 84116, (801) 596-1887. Email contact links and up
to date contact information can be found at the Foundation’s website
and official page at www.gutenberg.org/contact

Section 4. Information about Donations to

the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission of
increasing the number of public domain and licensed works that can
be freely distributed in machine-readable form accessible by the
widest array of equipment including outdated equipment. Many small
donations ($1 to $5,000) are particularly important to maintaining tax
exempt status with the IRS.

The Foundation is committed to complying with the laws regulating

charities and charitable donations in all 50 states of the United
States. Compliance requirements are not uniform and it takes a
considerable effort, much paperwork and many fees to meet and
keep up with these requirements. We do not solicit donations in
locations where we have not received written confirmation of
compliance. To SEND DONATIONS or determine the status of
compliance for any particular state visit www.gutenberg.org/donate.

While we cannot and do not solicit contributions from states where

we have not met the solicitation requirements, we know of no
prohibition against accepting unsolicited donations from donors in
such states who approach us with offers to donate.

International donations are gratefully accepted, but we cannot make

any statements concerning tax treatment of donations received from
outside the United States. U.S. laws alone swamp our small staff.

Please check the Project Gutenberg web pages for current donation
methods and addresses. Donations are accepted in a number of
other ways including checks, online payments and credit card
donations. To donate, please visit: www.gutenberg.org/donate.

Section 5. General Information About Project

Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could be
freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose network of
volunteer support.

Project Gutenberg™ eBooks are often created from several printed

editions, all of which are confirmed as not protected by copyright in
the U.S. unless a copyright notice is included. Thus, we do not
necessarily keep eBooks in compliance with any particular paper
edition.

Most people start at our website which has the main PG search
facility: www.gutenberg.org.

This website includes information about Project Gutenberg™,

including how to make donations to the Project Gutenberg Literary
Archive Foundation, how to help produce our new eBooks, and how
to subscribe to our email newsletter to hear about new eBooks.