Download the full version of the testbank or solution manual at

https://testbankmall.com

Solution Manual for A First Course in

Abstract Algebra, 8th Edition, John B.
Fraleigh, Neal Brand

https://testbankmall.com/product/solution-manual-
for-a-first-course-in-abstract-algebra-8th-
edition-john-b-fraleigh-neal-brand-2/

Explore and download more testbank or solution manual

at https://testbankmall.com
 Recommended digital products (PDF, EPUB, MOBI) that
you can download immediately if you are interested.

Solutions Manual to accompany A First Course in Abstract

Algebra 3rd edition 9780131862678

https://testbankmall.com/product/solutions-manual-to-accompany-a-
first-course-in-abstract-algebra-3rd-edition-9780131862678/

testbankmall.com

Solutions Manual to accompany A First Course in

Probability 8th edition 013603313x

https://testbankmall.com/product/solutions-manual-to-accompany-a-
first-course-in-probability-8th-edition-013603313x/

testbankmall.com

Solution Manual for A First Course in Mathematical

Modeling, 5th Edition

https://testbankmall.com/product/solution-manual-for-a-first-course-
in-mathematical-modeling-5th-edition/

testbankmall.com

Test Bank for US: A Narrative History Volume 1: To 1877,

8th Edition, James West Davidson, Brian DeLay, Christine
Leigh Heyrman Mark Lytle Michael Stoff
https://testbankmall.com/product/test-bank-for-us-a-narrative-history-
volume-1-to-1877-8th-edition-james-west-davidson-brian-delay-
christine-leigh-heyrman-mark-lytle-michael-stoff/
testbankmall.com
Solution Manual for Big C++: Late Objects 3rd Edition, Cay
S. Horstmann

https://testbankmall.com/product/solution-manual-for-big-c-late-
objects-3rd-edition-cay-s-horstmann/

testbankmall.com

Solution Manual for Case studies in Finance Managing for

Corporate Value Creation 6th Edition by Bruner

https://testbankmall.com/product/solution-manual-for-case-studies-in-
finance-managing-for-corporate-value-creation-6th-edition-by-bruner/

testbankmall.com

Principles of Money, Banking & Financial Markets

Ritter 12th Edition Test Bank

https://testbankmall.com/product/principles-of-money-banking-
financial-markets-ritter-12th-edition-test-bank/

testbankmall.com

Solution Manual for Management: A Faith-Based Perspective

– Michael E. Cafferky

https://testbankmall.com/product/solution-manual-for-management-a-
faith-based-perspective-michael-e-cafferky/

testbankmall.com

Solution Manual for Classical Electromagnetism Jerrold

Franklin

https://testbankmall.com/product/solution-manual-for-classical-
electromagnetism-jerrold-franklin/

testbankmall.com
Test Bank for Criminology: Theories, Patterns and
Typologies 13th Edition

https://testbankmall.com/product/test-bank-for-criminology-theories-
patterns-and-typologies-13th-edition/

testbankmall.com
The author and publisher of this book have used their best efforts in preparing this book.
These efforts include the development, research, and testing of the theories and
programs to determine their effectiveness. The author and publisher make no warranty
of any kind, expressed or implied, with regard to these programs or the documentation
contained in this book. The author and publisher shall not be liable in any event
for incidental or consequential damages in connection with, or arising out of, the
furnishing, performance, or use of these programs.

Reproduced by Pearson from electronic files supplied by the

author.

Copyright © 2021, 2003 by Pearson Education, Inc. 221 River Street, Hoboken,
NJ
07030. All rights
reserved.

All rights reserved. No part of this publication may be reproduced, stored in a retrieval
system, or transmitted, in any form or by any means, electronic, mechanical,
photocopying, recording, or otherwise, without the prior written permission of
the publisher. Printed in the United States of America.

ISBN-13: 978-0-32-139037-0
ISBN-10: 0-321-39037-7
Preface for Seventh Edition

This manual contains solutions to all exercises in the text, except those odd-numbered
exercises for which fairly lengthy complete solutions are given in the answers at the
back of the text. Then reference is simply given to the text answers to save typing.
I prepared these solutions myself. While I tried to be accurate, there are sure to be
the inevitable mistakes and typos. An author reading proof tends to see what he or she
wants to see. However, the instructor should find this manual adequate for the
purpose for which it is intended.

Morgan, Vermont J.B.F

July, 2002

Preface for Eighth Edition

In keeping with the seventh edition, this manual contains solutions to all exercises in
the text except for some of the odd-numbered exercises whose solutions are in the back
of the text book. I made few changes to solutions to exercises that were in the seventh
edition. However, solutions to new exercises do not always include as much detail as
would be found in the seventh edition. My thinking is that instructors teaching the class
would use the solution manual to see the idea behind a solution and they would
easily fill in the routine details.
As in the seventh edition, I tried to be accurate. However, there are sure to be
some errors. I hope instructors find the manual helpful.

Denton, Texas N.B.

March, 2020
 CONTENTS

0. Sets and Relations 01

I. Groups and Subgroups

1. Binary Operations 05
2. Groups 08
3. Abelian Examples 14
4. Nonabelian Examples 19
5. Subgroups 22
6. Cyclic Groups 27
7. Generators and Cayley Digraphs 32

II. Structure of Groups

8. Groups of Permutations 34
9. Finitely Generated Abelian Groups 40
10. Cosets and the Theorem of Lagrange 45
11. Plane Isometries 50

III. Homomorphisms and Factor Groups

12. Factor Groups 53

13. Factor Group Computations and Simple Groups 58
14. Group Action on a Set 65
15. Applications of G-Sets to Counting 70

VI. Advanced Group Theory

16. Isomorphism Theorems 73

17. Sylow Theorems 75
18. Series of Groups 80
19. Free Abelian Groups 85
20. Free Groups 88
21. Group Presentations 91
 V. Rings and Fields

22. Rings and Fields 95

23. Integral Domains 102
24. Fermat’s and Euler’s Theorems 106
25. RSA Encryption 109

VI. Constructing Rings and Fields

26. The Field of Quotients of an Integral Domain 110

27. Rings of Polynomials 112
28. Factorization of Polynomials over a Field 116
29. Algebraic Coding Theory 123
30. Homomorphisms and Factor Rings 125
31. Prime and Maximal Ideals 131
32. Noncommutative Examples 137

VII. Commutative Algebra

33. Vector Spaces 140

34. Unique Factorization Domains 145
35. Euclidean Domains 149
36. Number Theory 154
37. Algebraic Geometry 160
38. Gröbner Bases for Ideals 163

VIII. Extension Fields

39. Introduction to Extension Fields 168

40. Algebraic Extensions 174
41. Geometric Constructions 179
42. Finite Fields 182

IX. Galois Theory

43. Automorphisms of Fields 185

44. Splitting Fields 191
45. Separable Extensions 195
46. Galois Theory 199
47. Illustrations of Galois Theory 203
48. Cyclotomic Extensions 211
49. Insolvability of the Quintic 214

APPENDIX: Matrix Algebra 216

2 0. Sets
0. Sets
andand 1
Relations
Relations

0. Sets and Relations

1. { 3, − 3}
2. {2, –3}.
3. {1, −1, 2, −2, 3, −3, 4, −4, 5, −5, 6, −6, 10, −10, 12, −12, 15, −15, 20, −20, 30, −30,
60, −60}
4. {2, 3, 4, 5, 6, 7, 8}
+
5. It is not a well-defined set. (Some may argue that no element is large,
of
because every element exceeds only a finite number of other elements but
is exceeded by an infinite number of other elements. Such people might claim
the answer should be ∅.)
6. ∅
7. The set is ∅ because 33 = 27 and 43 = 64.
+
8. { r ∈ r =2 a for some a a ∈
n and some integer n ≥ 0}.

9. It is not a well-defined set.

10. The set containing all numbers that are (positive, negative, or zero)
integer multiples of 1, 1/2, or 1/3.
11. {(a, 1), (a, 2), (a, c), (b, 1), (b, 2), (b, c), (c, 1), (c, 2), (c,
c)}
12. a. This is a function which is both one-to-one and onto
B.
b. This not a subset of A × B, and therefore not a function.
c. It is not a function because there are two pairs with first member 1.
d. This is a function which is neither one-to-one (6 appears twice in the
second coordinate) nor onto B ( 4 is not in the second coordinate).
e. It is a function. It is not one-to-one because there are two pairs with second member 6.
It is not onto B because there is no pair with second member
2.
f. This is not a function mapping A into B since 3 is not in the first coordinate of
any ordered pair.
13. Draw the line through P and x, and let y be its point of intersection with the
line segment CD.
14. a. φ : [ 0,1] → [ 0, 2] where φ ( x ) = 2x

b. φ : [1, 3] → [ 5, 25] where φ ( x ) = 2x + 3

d −c
c. φ : [ a, b ] → [ c, d ] where φ ( x ) = c + ( x − a)

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
2 0. Sets
0. Sets
andand 2
Relations
Relations

b−a
15. Let φ : S → be defined by φ ( x ) tan(π (x − 21 )).
=

16. a. ∅; cardinality 1
b. ∅,{a}; cardinality 2
c. ∅,{a},{b},{a, b}; cardinality 4
d. ∅,{a},{b},{c},{a, b},{a, c},{b, c},{a, b, c}; cardinality 8

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
Visit https://testbankmall.com
now to explore a rich
collection of testbank,
solution manual and enjoy
exciting offers!
2 0. Sets
0. Sets
andand 3
Relations
Relations

17. | P ( A ) |= 2 s = 2|A|.
Conjecture:

Proof The number of subsets of a set A depends only on the cardinality of A, not
on what the elements of A actually are. Suppose B = {1, 2, 3, · · · , s − 1} and A =
{1, 2,
3, · · · , s}. Then A has all the elements of B plus the one additional element s.
All subsets of B are also subsets of A; these are precisely the subsets of A that
do not contain s, so the number of subsets of A not containing s is |P(B)|. Any
other subset of A must contain s, and removal of the s would produce a subset
of B. Thus the number of subsets of A containing s is also |P(B)|. Because every
subset of A either contains s or does not contain s (but not both), we see that the
number of subsets of A is 2|P(B)|.
We have shown that if A has one more element that B, then |P(A)| = 2|P(B)|.
Now
|P(∅)| = 1, so if |A| = s, then |P(A)| = 2s.
18. We define a one-to-one map φ of BA onto P(A). Let f ∈ BA, and let
φ ( f ) = {x ∈ A | f ( x ) = 1}. Suppose φ (f ) = φ (g). Then f (x) = 1 if and only if
g(x)
= 1. Because the only possible values for f (x) and g(x) are 0 and 1, we see that f
(x)
= 0 if and only if g(x) = 0. Consequently f (x) = g(x) for all x ∈ A so f = g and φ
is
one to one. To show that φ is onto P(A), let S ⊆ A, and let h : A → {0, 1}
be defined by h(x) = 1 if x ∈ S and h(x) = 0 otherwise. Clearly φ (h) = S, showing
that φ is indeed onto P(A).
19. Picking up from the hint, Z = {x ∈ A | x ∈ φ ( x )}. We claim that for any
let

a ∈ A, φ ( a ) = Z. Either a ∈ φ ( a ) , in which case a ∈ Z, or a ∈ φ ( a ) , in which

case a ∈ Z. Thus Z and φ (a) are certainly different subsets of A; one of them

contains a and the other one does not.

Based on what we just showed, we feel that the power set of A has cardinality
greater than |A|. Proceeding naively, we can start with the infinite set form its
,

power set, then form the power set of that, and continue this process indefinitely.
If there were only a finite number of infinite cardinal numbers, this process
would have to terminate after a fixed finite number of steps. Since it doesn’t, it
appears that there must be an infinite number of different infinite cardinal numbers.

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
2 0. Sets
0. Sets
andand 4
Relations
Relations

The set of everything is not logically acceptable, because the set of all subsets
of the set of everything would be larger than the set of everything, which is a
fallacy.
20. a. The set containing precisely the two elements of A and the three (different)
elements of B is C = {1, 2, 3, 4, 5} which has 5 elements.
i) Let A = {−2, −1, 0} and B = {1, 2, 3, · · ·} = + . Then |A| = 3 and |B| = ℵ0, and A
and
B have no elements in common. The set C containing all elements in either A or B is
C = {−2, −1, 0, 1, 2, 3, · · ·}. The map φ : C → B defined by φ (x) = x + 3 is one to
one and onto B, so |C| = |B| = ℵ0. Thus we consider 3 + ℵ0 = ℵ0.
ii) Let A = {1, 2, 3, · · ·} and B = {1/2, 3/2, 5/2, · · ·}. Then |A| = |B| = ℵ0 and A and
B
have no elements in common. The set C containing all elements in either A of B is C =
{1/2, 1, 3/2, 2, 5/2, 3, · · ·}. The map φ : C → A defined by φ (x) = 2x is one to one
and onto A, so |C| = |A| = ℵ0. Thus we consider ℵ0 + ℵ0 = ℵ0
b. We leave the plotting of the points in A × B to you. Figure 0.15 in the text,
where there are ℵ0 rows each having ℵ0 entries, illustrates that we would
consider that ℵ0 · ℵ0 = ℵ0.

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
2 0. Sets
0. Sets
andand 5
Relations
Relations

21. There are 102 = 100 numbers (.00 through .99) of the form .##, and 105 = 100,
000 numbers (.00000 through .99999) of the form .#####. Thus for .##### ·
· ·, we
expect 10ℵ sequences representing all numbers x ∈
0
such that 0 ≤ x ≤ 1, but a

sequence trailing off in 0’s may represent the same x ∈ as a sequence trailing of
in 9’s. At any rate, we should have ≥ |[0, 1]| = ; see Exercise 15. On the
10ℵ0

other hand, we can represent numbers in using any integer base n > 1, and these
same 10ℵ0 sequences using digits from 0 to 9 in base n = 12 would not represent all

x ∈ [0, 1], so we have 10ℵ ≤ 0

. Thus we consider the value of to be . We
10ℵ 0

could make the same argument using any other integer base n > 1, and
thus consider nℵ = for n ∈ + , n > 1. In particular, 12ℵ = 12ℵ =
0
. 0 0

(2 )
22. ℵ0 ,| |, 2| | , 2(2 ) , 2(2 )

23. 1. There is only one partition {{a}} of a one-element set {a}.

24. There are two partitions of {a, b}, namely {{a, b}} and {{a}, {b}}.
25. There are five partitions of {a, b, c}, namely {{a, b, c}}, {{a}, {b, c}}, {{b},
{a, c}}, {{c}, {a, b}}, and {{a}, {b}, {c}}.
26. 15. The set {a, b, c, d} has 1 partition into one cell, 7 partitions into two cells
(four with a 1,3 split and three with a 2,2 split), 6 partitions into three cells,
and 1 partition into four cells for a total of 15 partitions.
27. 52. The set {a, b, c, d, e} has 1 partition into one cell, 15 into two cells, 25
into three cells, 10 into four cells, and 1 into five cells for a total of 52.
(Do a combinatorics count for each possible case, such as a 1,2,2 split where
there are 15 possible partitions.)
28. Reflexive: In order for x R x to be true, x must be in the same cell of the partition
as the cell that contains x. This is certainly true.
Transitive: Suppose that x R y and y R z. Then x is in the same cell as y x = y,
so

and y is in the same cell as z so y = z. By the transitivity of the set equality

that

relation on the collection of cells in the partition, we see that x = 30. Not an
z equivalence
the same cell as z. Consequently, x R z. relation; 3 ≥
29. Not an equivalence relation; 0 is not related to 0, so it is not 2 but 2 ≥ 3,
reflexive.

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
2 0. Sets
0. Sets
andand 6
Relations
Relations

so it is not symmetric. so that x is in

31. Not an equivalence relation since transitivity fails: 3R 15 and 15 R 5, but 3 R 5.

Also not reflexive: 1 R 1.
32. 0 = (0, 0) and ( x, y ) is the circle centered at the origin with x2 + y2.
radius

33. (See the answer in the text.)

34. It is an equivalence relation;
1 = {1, 11, 21, 31,· · ·}, = {2, 12, 22, 32,· · ·}, · · ·, = {10, 20, 30, 40,· · ·}.
2 10

35. a. { . . . , –3, 0, 3, . . . }, { . . . , –2, 1, 4, . . .}, { . . . , –1, 2, 5, . . .}

b. { . . . , –4, 0, 4, . . . }, { . . . , –3, 1, 4, . . .}, { . . . , –6, –2, 2, . . .}, { . . . , –5, –1, 3, . . .}
c. { . . . , –5, 0, 5, . . . }, {. . . , –4, 1, 6, . . . }, { . . . , –3, 2, 7, . . .}, { . . . , –2, 3, 8, . . . }.
{ . . . , –1, 4, 9, . . . }

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
4 0. Sets
1. Binary
and 7
Relations
Operations

36. a. {0, 1, 2} b. { 0, 1, 2, 3} c. {0, 1, 2, 3, 4}

37. 1 = { x ∈ x ÷ n has remainder 1} depends on the value of n.

38. a. Let h, k, and m be positive integers. We check the three criteria.

Reflexive: h – h = n0 so h ∼ h.
Symmetric: If h ∼ k so that h – k = ns for some s ∈ , then k – h = n(–s) so k ∼ h.
Transitive: If h ∼ k and k ∼ m, then for some s, t ∈ we have h – k = ns and k – m
,

= nt. Then h – m = (h − k) + (k – m) = ns + nt = n(s + t), so h ∼ m.

b. Let h, k ∈ . In the sense of this exercise, h ∼ k if and only if h – k = nq for some
q ∈ . In the sense of Example 0.19, h ≡ k (mod n) if and only if h and k have the
same remainder when divided by n. Write h = nq1 + r1 and k = nq2 + r2 where 0 ≤ r1 <
n and 0 ≤
r2 < n. Then
h – k = n(q1 – q2) + (r1 – r2)
and we see that h – k is a multiple of n if and only if r1 = r2. Thus the conditions
are the same.
39. ( a1 + b1 ) − ( a2 + b2 ) = ( a1 − ) + ( b1 − b2 ) which is the sum of two multiples of n.
a2

Since the sum of two multiples of n is also a multiple of n, ( a1 + b1 ) ( a2 + b2 ) .

40. ( a1b1 ) − ( a2 b2 ) = ( a1b1 ) − ( a1b2 ) + ( a1b2 ) − ( a2b2 ) = a1 ( b1 − b2 ) + ( a1 − a2 which is
) b2
the sum of two multiples of n. Since the sum of two multiples of n is also a
multiple of n, ( a1b1 ) ( a2b2 ) .
41. The name two-to-two function suggests that such a function f should carry
every pair of distinct points into two distinct points. Such a function is one-to-
one in the conventional sense. (If the domain has only one element, the function
cannot fail to be two-to-two, because the only way it can fail to be two-to-two
is to carry two points into one point, and the set does not have two points.)
Conversely, every function that is one-to-one in the conventional sense carries
each pair of distinct points into two distinct points. Thus the functions
conventionally called one-to-one are precisely those that carry two points into
two points, which is a much more intuitive unidirectional way of regarding
them. Also, the standard way of trying to show that a function is one-to-one is
precisely to show that it does not fail to be two-to-two. That is, proving that a
function is one-to-one becomes more natural in the two-to-two terminology.

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
4 0. Sets
1. Binary
and 8
Relations
Operations

1. Binary Operations

1. b ∗ d = e, c ∗ c = b, [(a ∗ c) ∗ e] ∗ a = [c ∗ e] ∗ a = a ∗ a = a
2. (a ∗ b) ∗ c = b ∗ c = a and a ∗ (b ∗ c) = a ∗ a = a, so the operation might
be associative, but we can’t tell without checking all other triple products.
3. (b ∗ d) ∗ c = e ∗ c = a and b ∗ (d ∗ c) = b ∗ b = c, so the operation is
not associative.
4. It is not commutative because b ∗ e = c but e ∗ b = b.
5. Now d ∗ a = d so fill in d for a ∗ d. Also, c ∗ b = a so fill in a for b ∗ c. Now
b ∗ d = c so fill in c for d ∗ b. Finally, c ∗ d = b so fill in b for d ∗ c.
6. d ∗ a = (c ∗ b) ∗ a = c ∗ (b ∗ a) = c ∗ b = d. In a similar fashion, substituting c ∗ b
for d and using the associative property, we find that d ∗ b = c, d ∗ c = c, and d ∗ d
= d. a is an identity.
7. It is not commutative because 1 – 2 ≠ 2 – 1. It is not associative because 2 = 1
– (2 – 3) ≠ (1 – 2) – 3 = –4. No identity.
8. Commutative since 2ab + 3 = 2ba + 3. Not associative since (1 ∗ 2) ∗ 3 = 45 and
1 ∗ (2 ∗ 3) = 33. No identity since 0 ∗ e = 3 ≠ 0.
9. Commutative since a ∗ b = ab + a + b = b ∗ a. Associative since a ∗ b = (a +
1) (b + 1) – 1 making it easy to see that (a * b) ∗ c = (a + 1) (b + 1) (c + 1) – 1
= a ∗ (b ∗ c). The identity is 0.
+
10. It is commutative because 2ab = 2ba for a,b ∈ . It is not associative because
all
ab bc
(a ∗ b) ∗ c = 2ab ∗ c = 2(2 )c
, but a ∗ (b ∗ c) = a ∗ bc
= 2 a(2 ) . No identity.
2

11. It is not commutative because 2 ∗ 3 = 23 = 8 ≠ 9 = 32 = 3 ∗ 2. It is not associative

(b )
c

because a ∗ (b ∗ c) = a ∗ bc = a , but (a ∗ b) ∗ c = ab ∗ c = (ab)c = abc, and bc ≠

bc for some b, c ∈ + . No identity.
12. If S has just one element, there is only one possible binary operation on S; the
table must be filled in with that single element. If S has two elements, there
are 16 possible operations, for there are four places to fill in a table, and each
may be filled in two ways, and 2 ⋅ 2 ⋅ 2 ⋅ 2 = 16. There are 19,683 operations
on a set S with three elements, for there are nine places to fill in a table, and
39 = 19, 683. With n elements, there are n2 places to fill in a table, each of which
can be done in
( n2 )
n ways, so there are n possible tables.

13. A commutative binary operation on a set with n elements is completely determined

by the elements on or above the main diagonal in its table, which runs from
the upper left corner to the lower right corner. The number of such places to fill in
is

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
4 0. Sets
1. Binary
and 9
Relations
Operations

n2 − n n2 + n
n+ = .
2 2
( n2 +n ) / 2
Thus there are n possible commutative binary operations on an n-element

set. For n = 2, we obtain 23 = 8, and for n = 3 we obtain 36 = 729.

14. nn(n – 1)) since there are n2 – n = n(n – 1) spots to be filled once the diagonal
is filled.

Copyright
Copyright ©
© 2021
2021 Pearson
Pearson Education,
Education,
Inc.
Inc.
6 1. Binary Operations
((n–1) 2 )
15. n since after the first row and column are determined there are (n – 1)2
spots to be filled.
16. It is incorrect. Mention should be made of the underlying set for ∗ and
the universal quantifier, for all, should appear.
A binary operation ∗ on a set S is commutative if and only if a ∗ b = b ∗ a
for all a, b ∈ S.
17. The definition is correct.
18. It is incorrect. Replace the final S by H.
19. An identity in the set S with operation ∗ is element e ∈ such that for all a ∈ S,
S
a ∗ e = e ∗ a = a.
20. No, because e1 ∗ e2 = e1 and e1 ∗ e2 = e2.
21. This is an operation.
22. No. Condition 2 is violated. 1 ∗ 2 should be 0, but 0 ∉
+
.
23. No. Condition 2 is violated. 2 ∗ 1 should be 0, but
0∉ +.

24. No. Condition 1 is violated since the value of 1 ∗ 2 is not well defined as it
could either be 1 or –1. Also, Condition 2 is violated since –1 ∗ 2 is undefined.
25. It is not a binary operation. Condition 1 is violated, for 2 ∗ 3 might be any
integer greater than 9.
+
26. It is not a binary operation. Condition 2 is violated, for 1 ∗ 1 = 0 and 0 ∉ .
a −b  c −d  a + c −(b + d )
27. a. Yes.  + = a + c 
.
 b a   d c  b + d
a −b  c −d  ac − bd −(ad + bc)
b. Yes.    = ac − bd 
.
 b a   d c   ad + bc
28. F T F F F T T T T F F F T F
29. (See the answer in the text.)
30. We have (a ∗ b) ∗ (c ∗ d) = (c ∗ d) ∗ (a ∗ b) = (d ∗ c) ∗ (a ∗ b) = [(d ∗ c) ∗ a] ∗
b, where we used commutativity for the first two steps and associativity for the
last.
31. The statement is true. Commutativity and associativity assert the equality
of certain computations. For a binary operation on a set with just one element,
that element is the result of every computation involving the operation, so the
operation must be commutative and associative.
∗ a b
32. a b a The statement is false. Consider the operation on {a, b} defined by
b a a

the table. Then (a ∗ a) ∗ b = b ∗ b = a but a ∗ (a ∗ b) = a ∗ a = b.

Copyright © 2021 Pearson Education,

Inc.
33. It is associative.
Proof: [( f + g) + h](x) = ( f + g)(x) + h(x) = [ f (x) + g(x)] + h(x) = f (x) + [g(x) +
h(x)] = f (x) + [(g + h)(x)] = [ f + (g + h)](x) because addition in is associative.

Copyright © 2021 Pearson Education,

Inc.
 1. Binary 7
Operations
34. It is not commutative. Let f (x) = 2x and g(x) = 5x. Then ( f – g)(x) = f (x) – g(x) =
2x – 5x = –3x while (g – f )(x) = g(x) – f (x) = 5x – 2x = 3x.
35. It is not associative. Let f (x) = 2x, g(x) = 5x, and h(x) = 8x. Then [ f – (g – h)](x)
= f (x) – (g – h)(x) = f (x) – [g(x) – h(x)] = f (x) – g(x) + h(x) = 2x – 5x + 8x = 5x,
but [( f – g) – h](x) = ( f – g)(x) – h(x) = f (x) – g(x) – h(x) = 2x – 5x – 8x = –11x.
36. No identity.
37. The constant function f (x) = 1 is an identity element in F.
38. It is commutative.
Proof: ( f ⋅ g)(x) = f (x) ⋅ g(x) = g(x) ⋅ f (x) = (g ⋅ f )(x) because multiplication in
is commutative.
39. It is associative.
Proof: [( f ⋅ g) ⋅ h](x) = ( f ⋅ g)(x) ⋅ h(x) = [ f (x) ⋅ g(x)] ⋅ h(x) = f (x) ⋅ [g(x) ⋅ h(x)]
= [ f ⋅ (g ⋅ h)](x) because multiplication in is associative.
40. It is not commutative. Let f (x) = x2 and g(x) = x + 1. Then (f o g)(3) = f (g(3)) =
f (4) = 16 but (g o f )(3) = g(f (3)) = g(9) = 10.
41. It is not true. Let ∗ be + and let ∗′ be ⋅ and let S = . Then 2 + (3 ⋅ 5) = 17 but (2 +
3) ⋅ (2 + 5) = 35.
42. Let a, b ∈ H . By definition of H, we have a ∗ x = x ∗ a and b ∗ x = x ∗ b for all
x ∈ S. Using the fact that ∗ is associative, we then obtain, for x ∈ S,
all

(a ∗ b) ∗ x = a ∗ (b ∗ x) = a ∗ (x ∗ b) = (a ∗ x) ∗ b = (x ∗ a) ∗ b = x ∗ (a ∗ b).
This shows that a ∗ b satisfies the defining criterion for an element of H, so
(a ∗ b) ∈ H .
43. Let a, b ∈ H . By definition of H, we have a ∗ a = a and b ∗ b = b. Using, one
step at a time, the fact that ∗ is associative and commutative, we obtain
(a ∗ b) ∗ (a ∗b) = [(a ∗b) ∗ a]∗ b = [a ∗ (b ∗ a)]∗ b = [a ∗ (a ∗ b)]∗ b
= [(a ∗ a) ∗ b]∗ b = (a ∗b) ∗ b = a ∗ (b ∗ b) = a ∗b.
This show that a ∗ b satisfies the defining criterion for an element of H, so
(a ∗ b) ∈ H .
44. For any x, y ∈ S , x ∗ y = (x ∗ y) ∗ (x ∗ y) = ((x ∗ y) ∗ x) ∗ y = ((y ∗ x) ∗ x) ∗ y = ((x
∗ x) ∗ y) ∗ y = (x ∗ y) ∗ y = (y ∗ y) ∗ x = y ∗ x. So ∗ is commutative. Since ∗ is
commutative, (x ∗ y) ∗ z = (y ∗ z) ∗ x = x ∗ (y ∗ z) for x, y ∈ S . So ∗ is
and associative.

Copyright © 2021 Pearson Education,

Inc.
Visit https://testbankmall.com
now to explore a rich
collection of testbank,
solution manual and enjoy
exciting offers!
Exploring the Variety of Random
Documents with Different Content
Ombascha = Gefreiter der Schutztruppe.
Pesa = Kupfermünze; 64 Pesa = 1 Rupie (jetzt 100 Heller).
Poscho = die tägliche Essensration für Askari und Träger.
Pori = Busch; das Pori ist der Ort, wo sich die Schenzis dauernd, andere
Leute nur vorübergehend aufhalten. Man lagert „Porini“ = wo keine
Hütten sind, im unbewohnten Busch.
Pischi = ein Hohlmaß für Getreide.
Rupie = Silbermünze: deutsche Rupie = 1,34 Mk.
Schamba = Pflanzung, Acker.
Schensi = der Buschbewohner.
Wangoni = Nachkommen der in Deutsch-Ostafrika Mitte des vorigen
Jahrhunderts eingewanderten Sulukaffern.
 Druckfehlerberichtigung.
Seite 173. In der Unterschrift des Bildes muß es heißen:
Schwarzfersenantilope statt Schwarzharfenantilope.
Seite 226. In der Unterschrift des Bildes muß es heißen:... der Zahn
beginnt schon, wo er in der Knochenhöhlung des Oberkiefers
sitzt, s i c h z u w i n d e n; der Schädel muß also...
 Die Arbeiterfrage in Ostafrika.

Druck von A. W. Hayn’s Erben, Potsdam.

*** END OF THE PROJECT GUTENBERG EBOOK IM MORGENLICHT.
KRIEGS-, JAGD- UND REISE-ERLEBNISSE IN OSTAFRIKA ***

Updated editions will replace the previous one—the old editions

will be renamed.

Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States
copyright in these works, so the Foundation (and you!) can copy
and distribute it in the United States without permission and
without paying copyright royalties. Special rules, set forth in the
General Terms of Use part of this license, apply to copying and
distributing Project Gutenberg™ electronic works to protect the
PROJECT GUTENBERG™ concept and trademark. Project
Gutenberg is a registered trademark, and may not be used if
you charge for an eBook, except by following the terms of the
trademark license, including paying royalties for use of the
Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is
very easy. You may use this eBook for nearly any purpose such
as creation of derivative works, reports, performances and
research. Project Gutenberg eBooks may be modified and
printed and given away—you may do practically ANYTHING in
the United States with eBooks not protected by U.S. copyright
law. Redistribution is subject to the trademark license, especially
commercial redistribution.

START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
 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.