SB Hints and Answers to Selected Exercises

Appendix D Hints and Answers to Selected Exercises

1 Preliminaries
1.4 Exercises

Warm-up

1.4.2.

Hint.

(a)

A \times B = {(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3), (c, 1), (c, 2), (c, 3)};

(d)

A \times D = \emptyset .

🔗

1.4.6.

Hint.

x \in A \cup (B \cap C),

then either

x \in A

x \in B \cap C .

Thus,

x \in A \cup B

and

A \cup C .

Hence,

x \in (A \cup B) \cap (A \cup C) .

Therefore,

A \cup (B \cap C) \subset (A \cup B) \cap (A \cup C) .

Conversely, if

x \in (A \cup B) \cap (A \cup C),

then

x \in A \cup B

and

A \cup C .

Thus,

x \in A

x

is in both

B

and

C .

x \in A \cup (B \cap C)

and therefore

(A \cup B) \cap (A \cup C) \subset A \cup (B \cap C) .

Hence,

A \cup (B \cap C) = (A \cup B) \cap (A \cup C) .

🔗

1.4.10.

Hint.

(A \cap B) \cup (A ∖ B) \cup (B ∖ A) = (A \cap B) \cup (A \cap B^{'}) \cup (B \cap A^{'}) = [A \cap (B \cup B^{'})] \cup (B \cap A^{'}) = A \cup (B \cap A^{'}) = (A \cup B) \cap (A \cup A^{'}) = A \cup B .

🔗

1.4.14.

Hint.

A ∖ (B \cup C) = A \cap (B \cup C)^{'} = (A \cap A) \cap (B^{'} \cap C^{'}) = (A \cap B^{'}) \cap (A \cap C^{'}) = (A ∖ B) \cap (A ∖ C) .

🔗

More Exercises

1.4.18.

Hint.

(a)

f

is one-to-one but not onto.

f (R) = {x \in R : x > 0} .

(c)

f

is neither one-to-one nor onto.

f (R) = {x : - 1 \leq x \leq 1} .

🔗

1.4.20.

Hint.

(a)

f (n) = n + 1 .

🔗

1.4.22.

Hint.

(a) Let

x, y \in A .

Then

g (f (x)) = (g \circ f) (x) = (g \circ f) (y) = g (f (y)) .

Thus,

f (x) = f (y)

and

x = y,

g \circ f

is one-to-one. (b) Let

c \in C,

then

c = (g \circ f) (x) = g (f (x))

for some

x \in A .

Since

f (x) \in B,

g

is onto.

🔗

1.4.24.

Hint.

(a) Let

y \in f (A_{1} \cup A_{2}) .

Then there exists an

x \in A_{1} \cup A_{2}

such that

f (x) = y .

Hence,

y \in f (A_{1})

f (A_{2}) .

Therefore,

y \in f (A_{1}) \cup f (A_{2}) .

Consequently,

f (A_{1} \cup A_{2}) \subset f (A_{1}) \cup f (A_{2}) .

Conversely, if

y \in f (A_{1}) \cup f (A_{2}),

then

y \in f (A_{1})

f (A_{2}) .

Hence, there exists an

x \in A_{1}

or there exists an

x \in A_{2}

such that

f (x) = y .

Thus, there exists an

x \in A_{1} \cup A_{2}

such that

f (x) = y .

Therefore,

f (A_{1}) \cup f (A_{2}) \subset f (A_{1} \cup A_{2}),

and

f (A_{1} \cup A_{2}) = f (A_{1}) \cup f (A_{2}) .

🔗

1.4.28.

Hint.

Let

X = N \cup {\sqrt{2}}

and define

x \sim y

x + y \in N .

🔗

2 The Integers
2.4 Exercises

2.4.1.

Answer.

The base case,

S (1) : [1 (1 + 1) (2 (1) + 1)] / 6 = 1 = 1^{2}

is true.

🔗

Assume that

S (k) : 1^{2} + 2^{2} + \dots + k^{2} = [k (k + 1) (2 k + 1)] / 6

is true. Then

\begin{aligned} 1^{2} + 2^{2} + \dots + k^{2} + (k + 1)^{2} & = [k (k + 1) (2 k + 1)] / 6 + (k + 1)^{2} \\ = [(k + 1) ((k + 1) + 1) (2 (k + 1) + 1)] / 6, \end{aligned}

and so

S (k + 1)

is true. Thus,

S (n)

is true for all positive integers

n .

🔗

2.4.3.

Answer.

The base case,

S (4) : 4! = 24 > 16 = 2^{4}

is true. Assume

S (k) : k! > 2^{k}

is true. Then

(k + 1)! = k! (k + 1) > 2^{k} \cdot 2 = 2^{k + 1},

S (k + 1)

is true. Thus,

S (n)

is true for all positive integers

n .

🔗

2.4.9.

Hint.

Follow the proof in Example 2.1.4.

🔗

2.4.11.

Hint.

The base case,

S (0) : (1 + x)^{0} - 1 = 0 \geq 0 = 0 \cdot x

is true. Assume

S (k) : (1 + x)^{k} - 1 \geq k x

is true. Then

\begin{aligned} (1 + x)^{k + 1} - 1 & = (1 + x) (1 + x)^{k} - 1 \\ = (1 + x)^{k} + x (1 + x)^{k} - 1 \\ \geq k x + x (1 + x)^{k} \\ \geq k x + x \\ = (k + 1) x, \end{aligned}

S (k + 1)

is true. Therefore,

S (n)

is true for all positive integers

n .

🔗

2.4.17. Fibonacci Numbers.

Hint.

For Item 2.4.17.a and Item 2.4.17.b use mathematical induction. Item 2.4.17.c Show that

f_{1} = 1,

f_{2} = 1,

and

f_{n + 2} = f_{n + 1} + f_{n} .

Item 2.4.17.d Use part Item 2.4.17.c. Item 2.4.17.e Use part Item 2.4.17.b and Exercise 2.4.16.

🔗

2.4.19.

Hint.

Use the Fundamental Theorem of Arithmetic.

🔗

2.4.23.

Hint.

Let

S = {s \in N : a ∣ s,

b ∣ s} .

Then

S \neq \emptyset,

since

| a b | \in S .

By the Principle of Well-Ordering,

S

contains a least element

m .

To show uniqueness, suppose that

a ∣ n

and

b ∣ n

for some

n \in N .

By the division algorithm, there exist unique integers

q

and

r

such that

n = m q + r,

where

0 \leq r < m .

Since

a

and

b

divide both

m,

and

n,

it must be the case that

a

and

b

both divide

r .

Thus,

r = 0

by the minimality of

m .

Therefore,

m ∣ n .

🔗

2.4.27.

Hint.

Since

gcd (a, b) = 1,

there exist integers

r

and

s

such that

a r + b s = 1 .

Thus,

a c r + b c s = c .

Since

a

divides both

b c

and itself,

a

must divide

c .

🔗

2.4.29.

Hint.

Every prime must be of the form 2, 3,

6 n + 1,

6 n + 5 .

Suppose there are only finitely many primes of the form

6 k + 5 .

🔗

3 Groups
3.5 Exercises

3.5.1.

Hint.

(a)

3 + 7 Z = {\dots, - 4, 3, 10, \dots};

(c)

18 + 26 Z;

(e)

5 + 6 Z .

🔗

3.5.2.

Hint.

(a) Not a group; (c) a group.

🔗

3.5.6.

Hint.

\begin{array}{ccccc} \cdot & 1 & 5 & 7 & 11 \\ 1 & 1 & 5 & 7 & 11 \\ 5 & 5 & 1 & 11 & 7 \\ 7 & 7 & 11 & 1 & 5 \\ 11 & 11 & 7 & 5 & 1 \end{array}

🔗

3.5.8.

Hint.

Pick two matrices. Almost any pair will work.

🔗

3.5.15.

Hint.

There is a nonabelian group containing six elements.

🔗

3.5.16.

Hint.

Look at the symmetry group of an equilateral triangle or a square.

🔗

3.5.17.

Hint.

The are five different groups of order 8.

🔗

3.5.18.

Hint.

Let

σ = (\begin{matrix} 1 & 2 & \dots & n \\ a_{1} & a_{2} & \dots & a_{n} \end{matrix})

be in

S_{n} .

All of the

a_{i}

s must be distinct. There are

n

ways to choose

a_{1},

n - 1

ways to choose

a_{2},

\dots,

2 ways to choose

a_{n - 1},

and only one way to choose

a_{n} .

Therefore, we can form

σ

n (n - 1) \dots 2 \cdot 1 = n!

ways.

🔗

3.5.25.

Hint.

\begin{aligned} (a b a^{- 1})^{n} & = (a b a^{- 1}) (a b a^{- 1}) \dots (a b a^{- 1}) \\ = a b (a a^{- 1}) b (a a^{- 1}) b \dots b (a a^{- 1}) b a^{- 1} \\ = a b^{n} a^{- 1} . \end{aligned}

🔗

3.5.31.

Hint.

Since

a b a b = (a b)^{2} = e = a^{2} b^{2} = a a b b,

we know that

b a = a b .

🔗

3.5.35.

Hint.

H_{1} = {i d},

H_{2} = {i d, ρ_{1}, ρ_{2}},

H_{3} = {i d, μ_{1}},

H_{4} = {i d, μ_{2}},

H_{5} = {i d, μ_{3}},

S_{3} .

🔗

3.5.41.

Hint.

The identity of

G

1 = 1 + 0 \sqrt{2} .

Since

(a + b \sqrt{2}) (c + d \sqrt{2}) = (a c + 2 b d) + (a d + b c) \sqrt{2},

G

is closed under multiplication. Finally,

(a + b \sqrt{2})^{- 1} = a / (a^{2} - 2 b^{2}) - b \sqrt{2} / (a^{2} - 2 b^{2}) .

🔗

3.5.46.

Hint.

Look at

S_{3} .

🔗

3.5.49.

Hint.

Since

a^{4} b = b a,

it must be the case that

b = a^{6} b = a^{2} b a,

and we can conclude that

a b = a^{3} b a = b a .

🔗

3.5.55.

Answer.

1

🔗

3.5.56.

Answer.

2

🔗

3.5.57.

Answer.

n

🔗

3.5.58.

Answer.

n + 1

🔗

3.5.59.

3.5.59.a

Answer.

2

🔗

3.5.59.b

3.5.59.b.i

Answer.

6

🔗

3.5.59.b.ii

Answer.

10

🔗

3.5.60.

3.5.60.a

Answer.

4

🔗

3.5.60.b

3.5.60.b.i

Answer.

8

🔗

3.5.60.b.ii

Answer.

12

🔗

5 Runestone Testing
5.8 True/False Exercises

5.8.1. True/False.

Hint.

P_{n},

the vector space of polynomials with degree at most

n,

has dimension

n + 1

by Theorem 3.2.16. [Cross-reference is just a demo, content is not relevant.] What happens if we relax the defintion and remove the parameter

n ?

🔗

5.9 Multiple Choice Exercises

5.9.1. Multiple-Choice, Not Randomized, One Answer.

Hint 1.

What did you see last time you went driving?

🔗

Hint 2.

Maybe go out for a drive?

🔗

5.9.3. Multiple-Choice, Not Randomized, Multiple Answers.

Hint.

Do you know the acronym…ROY G BIV for the colors of a rainbow, and their order?

🔗

5.9.4. Multiple-Choice, Randomized, One Answer.

Hint 1.

What did you see last time you went driving?

🔗

Hint 2.

Maybe go out for a drive?

🔗

5.9.5. Multiple-Choice, Randomized, Multiple Answers.

Hint.

Do you know the acronym…ROY G BIV for the colors of a rainbow, and their order?

🔗

5.9.6. Mathematical Multiple-Choice, Not Randomized, Multiple Answers.

Hint.

You can take a derivative on any one of the choices to see if it is correct or not, rather than using techniques of integration to find a single correct answer.

🔗

5.9.7. Multiple-Choice, Not Randomized, One Answer.

Hint 1.

What did you see last time you went driving?

🔗

Hint 2.

Maybe go out for a drive?

🔗

5.10 Parsons Exercises

5.10.1. Parsons Problem, Mathematical Proof.

Hint.

Dorothy will not be much help with this proof.

🔗

5.10.6. Parsons Problem, Mathematical Proof, Numbered Blocks.

Hint.

Dorothy will not be much help with this proof.

🔗

5.12 Matching Exercises

5.12.3. Cardsort Problem, Linear Algebra.

Hint.

For openers, a basis for a subspace must be a subset of the subspace.

🔗

5.13 Clickable Area Exercises

5.13.3. Clickable Areas, Text in a Table.

Hint.

Python boolean variables begin with capital latters.

🔗

5.18 Fill-In Exercises

5.18.6. Fill-In, New Markup Strings.

Hint.

Do you really need a hint? Carefully reread the question.

🔗

5.18.10. Fill-In, Dynamic Math with Simple Numerical Answer.

5.18.11. Fill-In, Dynamic Math with Formulas as Answers.

5.18.12. Fill-In, Dynamic Math with Interdependent Formula Checking.

5.19 Hodgepodge

5.19.2. With Tasks in an Exercises Division.

5.19.2.a True/False.

Hint.

P_{n},

the vector space of polynomials with degree at most

n,

has dimension

n + 1

by Theorem 3.2.16. [Cross-reference is just a demo, content is not relevant.] What happens if we relax the defintion and remove the parameter

n ?

🔗

5.20 Exercises that are Timed

Timed Exercises

5.20.1. True/False.

Hint.

P_{n},

the vector space of polynomials with degree at most

n,

has dimension

n + 1

by Theorem 3.2.16. [Cross-reference is just a demo, content is not relevant.] What happens if we relax the defintion and remove the parameter

n ?

🔗

5.20.2. Multiple-Choice, Not Randomized, One Answer.

Hint 1.

What did you see last time you went driving?

🔗

Hint 2.

Maybe go out for a drive?

🔗

5.27 Group Exercises

5.27.1. Multiple-Choice, Not Randomized, One Answer.

Hint 1.

What did you see last time you went driving?

🔗

Hint 2.

Maybe go out for a drive?

🔗

Prev Top Next

Appendix D Hints and Answers to Selected Exercises

1 Preliminaries1.4 Exercises

Warm-up

1.4.2.

1.4.6.

1.4.10.

1.4.14.

More Exercises

1.4.18.

1.4.20.

1.4.22.

1.4.24.

1.4.28.

2 The Integers2.4 Exercises

2.4.1.

2.4.3.

2.4.9.

2.4.11.

2.4.17. Fibonacci Numbers.

2.4.19.

2.4.23.

2.4.27.

2.4.29.

3 Groups3.5 Exercises

3.5.1.

3.5.2.

3.5.6.

3.5.8.

3.5.15.

3.5.16.

3.5.17.

3.5.18.

3.5.25.

3.5.31.

3.5.35.

3.5.41.

3.5.46.

3.5.49.

3.5.55.

3.5.56.

3.5.57.

3.5.58.

3.5.59.

3.5.59.a

3.5.59.b

3.5.59.b.i

3.5.59.b.ii

3.5.60.

3.5.60.a

3.5.60.b

3.5.60.b.i

3.5.60.b.ii

5 Runestone Testing5.8 True/False Exercises

5.8.1. True/False.

5.9 Multiple Choice Exercises

5.9.1. Multiple-Choice, Not Randomized, One Answer.

5.9.3. Multiple-Choice, Not Randomized, Multiple Answers.

5.9.4. Multiple-Choice, Randomized, One Answer.

5.9.5. Multiple-Choice, Randomized, Multiple Answers.

5.9.6. Mathematical Multiple-Choice, Not Randomized, Multiple Answers.

5.9.7. Multiple-Choice, Not Randomized, One Answer.

5.10 Parsons Exercises

5.10.1. Parsons Problem, Mathematical Proof.

5.10.6. Parsons Problem, Mathematical Proof, Numbered Blocks.

5.12 Matching Exercises

5.12.3. Cardsort Problem, Linear Algebra.

5.13 Clickable Area Exercises

5.13.3. Clickable Areas, Text in a Table.

5.18 Fill-In Exercises

5.18.6. Fill-In, New Markup Strings.

5.18.10. Fill-In, Dynamic Math with Simple Numerical Answer.

5.18.11. Fill-In, Dynamic Math with Formulas as Answers.

5.18.12. Fill-In, Dynamic Math with Interdependent Formula Checking.

5.19 Hodgepodge

5.19.2. With Tasks in an Exercises Division.

5.19.2.a True/False.

5.20 Exercises that are Timed

Timed Exercises

5.20.1. True/False.

5.20.2. Multiple-Choice, Not Randomized, One Answer.

1 Preliminaries
1.4 Exercises

2 The Integers
2.4 Exercises

3 Groups
3.5 Exercises

5 Runestone Testing
5.8 True/False Exercises