• Home
  • Textbooks
  • Discrete Mathematics with Proof
  • Proof

Discrete Mathematics with Proof

Eric Gossett

Chapter 3

Proof - all with Video Answers

Educators


Chapter Questions

05:06

Problem 1

Prove, without using mathematical induction, that $\sum_{k=1}^{2 m} k=$ $m(2 m+1)$ for all positive integers, $m$.

Sriparna Bhattacharjee
Sriparna Bhattacharjee
Numerade Educator
01:05

Problem 1

Can we prove the following additional theorem for Example $3.4 ?^{16}$
Theorem Z: There are exactly six lines.

Carson Merrill
Carson Merrill
Numerade Educator
08:18

Problem 1

Use the algorithm from the proof of Theorem 3.4 to find the greatest common divisors of the following pairs of numbers. Then find $s$ and $t$ so that the ged can be expressed in the form $a s+b t$.
(a) 24 and 148
(b) 346 and 1056
(c) 63 and 178

Jerelyn Nevil
Jerelyn Nevil
Numerade Educator
21:42

Problem 1

The following formulas can all be proved by mathematical induction.
(a) $1^2+2^2+3^2+\cdots+n^2=\frac{n(n+1)(2 n+1)}{6}$ for all natural numbers, $n$ with $n \geq 1$.
(b) $2^m>m$ for all natural numbers, $m$ with $m \geq 1$.
(c) $a^n<1$ for all real numbers, $a$, with $0 \leq a<1$ and all natural numbers, $n$ with $n \geq 1$ Clearly identify where you have used the assumption $0 \leq a$ and then explain why the proof would fail if $a<0$.
(d) $\sum_{k=1}^n \frac{1}{k^2}<2-\frac{1}{n}$ for all natural numbers, $n$ with $n \geq 2$.

Carlos Pinilla
Carlos Pinilla
Numerade Educator
00:48

Problem 2

Use the result of Exercise 1 to
(a) Find the value of $\sum_{k=1}^{2 m+1} k$ for $m \geq 0$, where $m \in \mathbb{N}$.
(b) Provide a noninductive proof that $\sum_{k=1}^n k=\frac{n(n+1)}{2}$ for $n \geq 1$, where $n \in \mathbb{N}$.

Linh Vu
Linh Vu
Numerade Educator
01:31

Problem 2

If we change Axiom 3 in Example 3.4 to "For any point $P$ and any line $L$, there is a line through $P$ and parallel to $L, "$ what happens to theorems $\mathrm{W}$ through $\mathrm{Z}$ ?

Allison Knapp
Allison Knapp
Numerade Educator
04:59

Problem 2

Prove: If $n \in \mathbb{Z}$, then $n^3-n$ is even. Note: Part (a) is the preferred proof. Parts (b) and (c) are just for practice [and may freely use any intermediate results derived in part (a)].
(a) Use a direct proof.
(b) Use an indirect proof that utilizes a vacuous proof. (Hint: Factor $n^3-n$ after writing the contrapositive. Show that it cannot be an odd number.)
(c) Use a proof by contradiction.

Adam Dehollander
Adam Dehollander
Numerade Educator

Problem 2

Prove that
$$
\sum_{k=0}^n\left(\frac{-1}{2}\right)^k=\frac{2}{3}+\frac{1}{3} \cdot\left(\frac{-1}{2}\right)^n
$$
for all natural numbers, $n$ with $n \geq 0$.

Check back soon!
01:09

Problem 3

Find the error in the proof of the given claim. Additionally, determine whether the claim is true or false. If it is true, provide a correct proof. If it is false, find a counterexample.

Carson Merrill
Carson Merrill
Numerade Educator

Problem 3

Suppose we change Axiom 4 in Example 3.4 to "There are at least five points." Show that the new set of axioms is inconsistent.

Check back soon!
01:09

Problem 3

Find the error in the proof of the given claim. Additionally, determine whether the claim is true or false. If it is true, provide a correct proof. If it is false, find a counterexample.

Carson Merrill
Carson Merrill
Numerade Educator
04:19

Problem 3

Formulate a theorem for the sum $\sum_{i=0}^n(a+i d)$ of the first $n+1$ elements in an arithmetic progression. Indicate how you arrived at the formula, and then use mathematical induction to prove the formula.

Julian Wong
Julian Wong
Numerade Educator
01:33

Problem 4

Prove that if $n$ is an even integer and $m$ is an odd integer, then either 4 divides $m n$ or 4 does not divide $n$.

Manisha Sarker
Manisha Sarker
Numerade Educator

Problem 4

Each statement is either true or false. Identify which case is correct, and then give some justification for your answer.
(a) Every definition is either explicitly or implicitly an "if and only if" statement.
(b) Axioms are logical consequences of the primary definitions in a mathematical system.
(c) Suppose the following axioms are used in a revised definition of Boolean algebra: identity, idempotence, complement, commutativity, distributivity. The resulting axiom set is independent.
(d) The amount of detail in a proof should be the same for all audiences.
(e) If your instructor has a Ph.D. in mathematics, then a brief outline is sufficient detail for any proof on the homework.

Check back soon!

Problem 4

Prove the following implication. "If $p>2$ is an even prime, then $p>2^{100}+1$."

Check back soon!
03:26

Problem 4

Find a formula for
$$
\frac{1}{2}+\frac{1}{2^2}+\frac{1}{2^3}+\cdots+\frac{1}{2^n} \quad n \geq 1 .
$$
Indicate how you arrived at the formula, and then use mathematical induction to prove the formula.

Julian Wong
Julian Wong
Numerade Educator
02:57

Problem 5

Use an indirect proof to prove the following: "If $2^n-1$ is prime, then $n$ is prime." (Hint: Try some examples. Factoring $2^n-1$ is easier when $n$ is an even composite integer.)

Bryan Lynn
Bryan Lynn
Numerade Educator
01:56

Problem 5

In any axiomatic system, some terms must remain undefined. Why is this necessary?

Joshua Fischbach
Joshua Fischbach
Numerade Educator
05:25

Problem 5

Prove the following implication. "If $\pi$ is an irrational number, then 2 is a prime number."

Mohamed Mohamed
Mohamed Mohamed
Numerade Educator
02:45

Problem 5

Find a formula for
$$
\frac{1}{a}+\frac{1}{a^2}+\frac{1}{a^3}+\cdots+\frac{1}{a^n}
$$
for $n \in \mathbb{N}, n \geq 1$ and $a \in \mathbb{R}, a>0, a \neq 1$. Indicate how you arrived at the formula, and then use mathematical induction to prove the formula.

Kumar  Vaibhav
Kumar Vaibhav
Numerade Educator
00:48

Problem 6

Let $a, b$, and $c$ be integers with $a \neq 0$. Prove that if $a \mid b$ and $a \mid(b+c)$, then $a \mid c$.

James Chok
James Chok
Numerade Educator
13:03

Problem 6

Each statement is either true or false. Identify which case is correct, and then give some justification for your answer.
(a) The number 1 is a prime.
(b) If $a$ divides $b$, then there is an integer, $c$, such that $a=b c$.
(c) If $a$ divides $b$, then there is an integer, $k$, such that $b=a k$.
(d) The well-ordering principle states that every set of natural numbers contains a smallest element.
(e) If $x, y \in \mathbb{Z}$ and $x-y$ is divisible by $z$, then $x \equiv y \bmod z$.

AG
Ankit Gupta
Numerade Educator
00:41

Problem 6

Every rational solution of $x^2-2=0$ is an integer.

Nick Johnson
Nick Johnson
Numerade Educator
08:10

Problem 6

Find a formula for
$$
\sum_{i=1}^n \frac{1}{i(i+1)} \quad n \in \mathbb{N}, n \geq 1 .
$$
Indicate how you arrived at the formula, and then use mathematical induction to prove the formula.

Linda Hand
Linda Hand
Numerade Educator
02:20

Problem 7

Prove that the square of any integer can be written in one of the following forms: $4 k$ or $4 k+1$.

Mohamed Mohamed
Mohamed Mohamed
Numerade Educator

Problem 7

Each statement is either true or false. Identify which case is correct, and then give some justification for your answer.
(a) Every positive integer is divisible by at least two distinct integers.
(b) For any integer, $a$, the remainder on dividing $5 a^2$ by $a$ is always 0 .
(c) The Euclidean division algorithm plays a crucial role in the proof of the well-ordering principle.
(d) If $m$ and $n$ are odd integers, then $m=2 k+1$ and $n=2 k+1$ for some integer, $k$.

Check back soon!

Problem 7

Let $A$ and $B$ be sets. Prove: "If $A \cap B=\emptyset$, then $\emptyset \subseteq A$."

Check back soon!
03:26

Problem 7

Find a formula for
$$
1 \cdot 2+2 \cdot 3+\cdots+n(n+1) \quad n \in \mathbb{N}, n \geq 1 .
$$
Indicate how you arrived at the formula, and then use mathematical induction to prove the formula.

Julian Wong
Julian Wong
Numerade Educator
03:47

Problem 8

Use a proof by contradiction to show that if $n$ is any integer, then $n^2-3$ is not divisible by 4 . You may use the result of Exercise 7.

Jacob Shpiece
Jacob Shpiece
Numerade Educator

Problem 8

For each pair of integers, $x$ and $y$, find the $q$ and $r$ (from the Euclidean division algorithm) that make $x=y q+r$. Express the results in a table.
$$
\begin{array}{l|rr|rr}
& \boldsymbol{x} & \boldsymbol{y} & \boldsymbol{q} & \boldsymbol{r} \\
\hline \text { (a) } \boldsymbol{} & 2961 & 987 & & \\
\text { (b) } & 567 & 450 & \\
\text { (c) } & 2388 & 309 & \\
\text { (d) } & 1135 & 39 &
\end{array}
$$

Check back soon!
02:11

Problem 8

Prove the implication: If $x \in \mathbb{R}$ and $|x|$ is negative, then $x^3$ is negative.

Dorcas Attuabea Addo
Dorcas Attuabea Addo
Numerade Educator
03:26

Problem 8

Find a formula for
$$
1 \cdot 1 !+2 \cdot 2 !+\cdots+n \cdot n ! \quad n \in \mathbb{N}, n \geq 1 .
$$
Indicate how you arrived at the formula, and then use mathematical induction to prove the formula.

Julian Wong
Julian Wong
Numerade Educator
01:00

Problem 9

Prove that the sum of two odd integers is an even integer.

Raj Bala
Raj Bala
Numerade Educator
View

Problem 9

For each integer, $x$, factor $x$ as a product of primes. Express the results in a table.
$$
\begin{array}{l|r|l}
& \boldsymbol{x} & \boldsymbol{x} \text { (as a product of primes) } \\
\hline \text { (a) } \boldsymbol{} & 2548 & \\
\text { (b) } & 4116 & \\
\text { (c) } & 2366 & \\
\text { (d) } & 420 &
\end{array}
$$

Nick Johnson
Nick Johnson
Numerade Educator
08:26

Problem 9

Let $a$ and $b$ be positive integers with $a \bmod 3=1$ and $b \bmod 3=2$. Use a direct proof to show that $(a b) \bmod 3=2$.

Chris Trentman
Chris Trentman
Numerade Educator
03:18

Problem 9

Let $n \in \mathbb{N}$, with $n \geq 1$. Show that
$$
\begin{aligned}
1+(1+2)+(1+2+3) & +\cdots+(1+2+\cdots+n) \\
& =\sum_{k=1}^n\left(\sum_{i=1}^k i\right) \\
& =\frac{n(n+1)(n+2)}{6} .
\end{aligned}
$$

Ziya Ogron
Ziya Ogron
Numerade Educator
01:00

Problem 10

Prove that the sum of an odd number of odd integers is odd. You may use the result of Exercise 9.

Raj Bala
Raj Bala
Numerade Educator
View

Problem 10

For each pair of integers, $x$ and $y$, find $\operatorname{gcd}(x, y)$. Express the results in a table.
$$
\begin{array}{l|rr|r}
& \boldsymbol{x} & \boldsymbol{y} & \boldsymbol{g c d}(\boldsymbol{x}, \boldsymbol{y}) \\
\hline \text { (a) } \boldsymbol{} & 688 & 108 & \\
\text { (b) } & 33 & 616 & \\
\text { (c) } & 444 & 1098 & \\
\text { (d) } & 224 & 196 &
\end{array}
$$

Victor Salazar
Victor Salazar
Numerade Educator
00:39

Problem 10

Let $a, b \in \mathbb{Q}$. Use the field axioms (Appendix A.3) and direct proof to prove that $(a+b)^2=a^2+2 a b+b^2$.

Rakvi .
Rakvi .
Numerade Educator

Problem 10

Let $A, B_1, B_2, \ldots, B_n$ be sets, with $n \geq 2$. Prove that
$$
\begin{aligned}
A \cap\left(B_1 \cup B_2\right. & \left.\cup \cdots \cup B_n\right) \\
& =\left(A \cap B_1\right) \cup\left(A \cap B_2\right) \cup \cdots \cup\left(A \cap B_n\right) .
\end{aligned}
$$

Check back soon!
02:46

Problem 11

10 Prove that the sum of two rational numbers is a rational number.

Carson Merrill
Carson Merrill
Numerade Educator
View

Problem 11

For each pair of integers, $x$ and $y$, find $\operatorname{lcm}(x, y)$. Express the results in a table.
$$
\begin{array}{l|rr|l}
& \boldsymbol{x} & \boldsymbol{y} & \operatorname{lcm}(\boldsymbol{x}, \boldsymbol{y}) \\
\hline \text { (a) } \boldsymbol{} & 999 & 93 & \\
\text { (b) } & 207 & 46 & \\
\text { (c) } & 34 & 343 & \\
\text { (d) } & 1065 & 104 &
\end{array}
$$

Victor Salazar
Victor Salazar
Numerade Educator
01:57

Problem 11

Let $a$ be a real number with $0<a<1$. Use a direct proof to show that $a>a^2$.

Dorcas Attuabea Addo
Dorcas Attuabea Addo
Numerade Educator
06:40

Problem 11

Let $n \in \mathbb{N}$, with $n \geq 1$. Use mathematical induction to show that
$$
1+2+3+\cdots+n=\sum_{i=1}^n i<\frac{(2 n+3)^2}{7}
$$

Linda Hand
Linda Hand
Numerade Educator
01:10

Problem 12

Prove that the product of two rational numbers is a rational number.

Nick Johnson
Nick Johnson
Numerade Educator
04:13

Problem 12

For each pair of integers, $x$ and $y$, find $x \bmod y$. Express the results in a table.
$$
\begin{array}{l|rr|l}
& \boldsymbol{x} & \boldsymbol{y} & \boldsymbol{x} \bmod \boldsymbol{y} \\
\hline \text { (a) } \boldsymbol{} & 57 & 701 & \\
\text { (b) } & 1091 & 786 & \\
\text { (c) } & 1085 & 239 & \\
\text { (d) } & 2002 & 34 &
\end{array}
$$

Brenda Sanchez
Brenda Sanchez
Numerade Educator
03:46

Problem 12

Let $a, b \in \mathbb{R}$ with $a \geq 0$ and $b \geq 0$. Use a direct proof to show that $\frac{a+b}{2} \geq \sqrt{a \bar{b}}$.

Dorcas Attuabea Addo
Dorcas Attuabea Addo
Numerade Educator
02:57

Problem 12

Use mathematical induction to show that $x^2-1$ is divisible by 8 when $x$ is any positive odd integer.

Nick Johnson
Nick Johnson
Numerade Educator
01:07

Problem 13

Prove that the sum of a rational and an irrational is an irrational.

Carson Merrill
Carson Merrill
Numerade Educator

Problem 13

For each pair of integers, $x$ and $y$, do all the following.
i. Find the $q$ and $r$ (from the Euclidean division algorithm) that make $x=y q+r$.
ii. Factor $x$ and $y$ as products of primes.
iii. Find $\operatorname{gcd}(x, y)$.
iv. Find $\operatorname{lcm}(x, y)$.
v. Find $x \bmod y$.
vi. Is $x \equiv y \bmod 5$ ?
Express the results in a table.
$$
\begin{array}{l|rr|llllll}
& \boldsymbol{x} & \boldsymbol{y} & \text { (i) } & \text { (ii) } & \text { (iii) } & \text { (iv) } & \text { (v) } & \text { (vi) } \\
\hline \text { (a) } & 684 & 96 & & & & & & \\
\text { (b) } & 1212 & 895 & & & & & & \\
\text { (c) } & 1002 & 102 & & & & & & \\
\text { (d) } & 18 & 56 & & & & & &
\end{array}
$$

Check back soon!

Problem 13

Let $a$ and $b$ be integers. Prove: If $\operatorname{gcd}(a, b)>1$, then $\operatorname{gcd}\left(a^2, b^2\right)>1$.

Check back soon!
06:29

Problem 13

Prove that every integer, $n$, can be written in the form $5 \cdot a+7 \cdot b$, where $a, b \in \mathbb{Z}$. Use mathematical induction to show this for all integers $n \geq 0$. Then think of another way to validate the claim for all integers $n<0$.

Sriparna Bhattacharjee
Sriparna Bhattacharjee
Numerade Educator
02:18

Problem 14

If $x$ is irrational, then $x+(-x)=0$ is a rational. Suppose that $y$ is also an irrational with $y \neq-x$. Prove or find a counterexample: $x+y$ is irrational.

Adriano Chikande
Adriano Chikande
Numerade Educator
00:54

Problem 14

List five integers that are congruent to $5 \bmod 11$.

James Chok
James Chok
Numerade Educator
02:14

Problem 14

Use an indirect proof to prove the following assertion. "If $n>2$ is a prime, then $n$ is odd."

Raushan Kumar
Raushan Kumar
Numerade Educator
04:13

Problem 14

Let $n \in \mathbb{N}$, with $n \geq 0$ and let $x, y \in \mathbb{R}$ with $x \neq-y$. Use mathematical induction to show that $x^{2 n}-y^{2 n}$ is divisible by $x+y$.

Himanshu Kushwaha
Himanshu Kushwaha
Numerade Educator
01:33

Problem 15

Prove or find a counterexample: The product of a nonzero rational and an irrational is irrational.

James Chok
James Chok
Numerade Educator
00:36

Problem 15

Is 4.5 divisible by 1.5 ? Justify your answer.

Kayla Laughman
Kayla Laughman
Numerade Educator
01:28

Problem 15

Use an indirect proof to prove the following assertion. "If $A$ and $B$ are sets and $x \in(B-A)$, then $x \notin(A \cap B)$."

WM
William Mead
Numerade Educator
03:56

Problem 15

Let $n \in \mathbb{N}$, with $n \geq 2$. Show that $n !<n^n$.

Chris Trentman
Chris Trentman
Numerade Educator
01:39

Problem 16

Prove or find a counterexample: The product of two irrational numbers is irrational.

Adam Dehollander
Adam Dehollander
Numerade Educator

Problem 16

Consider the integers 32 and 107. By the Euclidean division algorithm, there exist unique integers, $q$ and $r$, such that $32=107 q+r$. However, note that $32=107 \cdot 0+32$ and $32=107 \cdot(-1)+139$. Resolve the contradiction.

Check back soon!
00:58

Problem 16

Let $a>0$ be a real number. Use an indirect proof to show "If $a<1$, then $\sqrt{a}>a$."

AG
Ankit Gupta
Numerade Educator

Problem 16

Prove that
$$
1+\frac{1}{\sqrt{2}}+\frac{1}{\sqrt{3}}+\cdots+\frac{1}{\sqrt{n}}=\sum_{i=1}^n \frac{1}{\sqrt{i}}>2(\sqrt{n+1}-1)
$$
for $n \in \mathbb{N}$, with $n \geq 1$.

Check back soon!
02:10

Problem 17

Let $x \in \mathbb{Z}$. Prove that $x$ is divisible by 3 if and only $x^2-1$ is not divisible by 3 .

James Chok
James Chok
Numerade Educator
01:49

Problem 17

Suppose that $a$ and $b$ are positive integers. How many integers not exceeding $a$ are divisible by $b$ ?

James Chok
James Chok
Numerade Educator
01:34

Problem 17

Let $c \in \mathbb{Z}$. Prove: If $c^5+7$ is even, then $c$ is odd.

AG
Ankit Gupta
Numerade Educator

Problem 17

Let $x, y_1, y_2, \ldots, y_n$ be elements in a Boolean algebra, with $n \geq 2$. Prove
$$
x+\left(y_1 \cdot y_2 \cdots y_n\right)=\left(x+y_1\right) \cdot\left(x+y_2\right) \cdots\left(x+y_n\right) .
$$

Check back soon!

Problem 18

Prove Proposition 3.8 by using the strategy $1 \leftrightarrow 2$ and $2 \leftrightarrow 3$.

Check back soon!
02:06

Problem 18

Suppose that you are really excited about your vacation to Florida and have calculated that you are leaving in 224 hours. If it is 5 P.M. right now, what time will it be then? Use material from this section to justify your answer.

Ernest Castorena
Ernest Castorena
Numerade Educator
01:28

Problem 18

Let $A$ and $B$ be sets. Use a proof by contradiction to show that $(A-B) \cap B=\emptyset$.

WM
William Mead
Numerade Educator
03:42

Problem 18

Let $n$ be a positive integer. Prove that
$$
\frac{1}{2 n} \leq \frac{1 \cdot 3 \cdot 5 \cdots(2 n-3) \cdot(2 n-1)}{2 \cdot 4 \cdot 6 \cdots(2 n-2) \cdot(2 n)} .
$$

Clarissa Noh
Clarissa Noh
Numerade Educator
03:25

Problem 19

Suppose $n \in \mathbb{Z}$ is not divisible by 3 . Prove that $n^2 \bmod 3=1$.

Julian Wong
Julian Wong
Numerade Educator
00:26

Problem 19

Let $a, b, c \in \mathbb{Z}$ and $a \neq 0$. Use a proof by contradiction to show that if $a \nmid b c$, then $a \nmid b$.

Mengchun Cai
Mengchun Cai
Numerade Educator
01:02

Problem 19

$\mathbf{F}$ Let $n \in \mathbb{N}$. Prove that
$$
\frac{2 n+1}{2 n+2} \leq \frac{\sqrt{n+1}}{\sqrt{n+2}}
$$

Linh Vu
Linh Vu
Numerade Educator
08:41

Problem 20

Let $p>5$ be a prime. Prove that $p+2$ is not a prime.

Mengchun Cai
Mengchun Cai
Numerade Educator
09:09

Problem 20

Let $a, b \in \mathbb{R}$ with $a \geq 0$ and $b \geq 0$. Use a proof by contradiction to show that $\frac{a+b}{2} \geq \sqrt{a \bar{b}}$.

Bobby Barnes
Bobby Barnes
University of North Texas
02:46

Problem 20

Let $n$ be a positive integer. Prove that
$$
\frac{1 \cdot 3 \cdot 5 \cdots(2 n-3) \cdot(2 n-1)}{2 \cdot 4 \cdot 6 \cdots(2 n-2) \cdot(2 n)} \leq \frac{1}{\sqrt{n+1}} .
$$

Sanchit Jain
Sanchit Jain
Numerade Educator
01:33

Problem 21

I4 Let $x, y \in \mathbb{R}$. Prove that $|x y|=|x| \cdot|y|$.

Amany Waheeb
Amany Waheeb
Numerade Educator

Problem 21

Let $a, b$, and $c$ form a primitive Pythagorean triple with $a$ being odd and $a^2+b^2=c^2$. Then $a^2=c^2-b^2=(c+b)(c-b)$.
(a) Use a proof by contradiction to show that $c+b$ and $c-b$ have no common prime factors.
(b) Now prove (using any strategy) that $c+b$ and $c-b$ are both squares.

Check back soon!

Problem 21

Prove
$$
\prod_{k=2}^n\left(1-\frac{1}{k^2}\right)=\frac{n+1}{2 n} \quad \forall n \in \mathbb{N} \text { with } n \geq 2 .
$$
The results of the next two problems will be used in Chapter 11.

Check back soon!
01:05

Problem 22

Use a proof by contradiction to show that the equation $x^3+3 x+3=0$ has no solutions in $\mathbb{Q}$. (Hint: Use a proof by cases inside the proof by contradiction.)

Helen Latting
Helen Latting
Numerade Educator
01:21

Problem 22

Use a proof by cases to show that if $n \in \mathbb{Z}$, then $n^2+n$ is even.

Adriano Chikande
Adriano Chikande
Numerade Educator

Problem 22

Let $h \geq 0$ be an integer. Prove that
$$
\sum_{i=0}^h(h-i) 2^i=2^{h+1}-h-2 .
$$

Check back soon!
01:30

Problem 23

Let $a$ and $b$ be real numbers. Prove that $\max (a, b)+\min (a, b)=a+b$.

Katelyn Chen
Katelyn Chen
Numerade Educator
03:25

Problem 23

Prove: If $n$ is an integer and $3 \mid n^2$, then $3 \mid n$. (Hint: Look at remainders $\bmod 3$.)

Julian Wong
Julian Wong
Numerade Educator

Problem 23

Let $h \geq 0$ be an integer. Prove that
$$
\sum_{i=0}^h i 2^i=(h-1) 2^{h+1}+2 \text {. }
$$

Check back soon!
01:30

Problem 24

Let $a$ and $b$ be real numbers. Prove
(a) $\max (a, b)=\frac{a+b}{2}+\left|\frac{a-b}{2}\right|$
(b) $\min (a, b)=\frac{a+b}{2}-\left|\frac{a-b}{2}\right|$

Katelyn Chen
Katelyn Chen
Numerade Educator
01:59

Problem 24

Prove that for all real numbers $x$ and $y,|x+y| \leq|x|+|y|$.

Adriano Chikande
Adriano Chikande
Numerade Educator
01:17

Problem 24

What is wrong with the following proof that all horses have the same color?

Nick Johnson
Nick Johnson
Numerade Educator
07:18

Problem 25

Let $a$ and $b$ be positive integers where $a=p_1^{a_1} p_2^{a_2} \ldots p_k^{a_k}$ and $b=p_1^{b_1} p_2^{b_2} \cdots p_k^{b_k}$ with $a_i, b_i \geq 0$. Prove that
(a) $\operatorname{gcd}(a, b)=p_1^{\min \left(a_1, b_1\right)} p_2^{\min \left(a_2, b_2\right)} \cdots p_k^{\min \left(a_k, b_k\right)}$
(b) $\operatorname{lcm}(a, b)=p_1^{\max \left(a_1, b_1\right)} p_2^{\max \left(a_2, b_2\right)} \cdots p_k^{\max \left(a_k, b_k\right)}$

Bryan Lynn
Bryan Lynn
Numerade Educator
01:30

Problem 25

DEFINITION 3.15 max; min
Let $a$ and $b$ be real numbers. Then
$$
\max (a, b)= \begin{cases}a & \text { if } a \geq b \\ b & \text { if } a<b\end{cases}
$$
and
$$
\min (a, b)=\left\{\begin{array}{ll}
a & \text { if } a \leq b \\
b & \text { if } a>b
\end{array} .\right.
$$
Let $a$ and $b$ be real numbers. Use Definition 3.15 to prove that $\max (a, b)+\min (a, b)=a+b$. (Hint: Use the cases $a \leq b$ and $a>b$.

Katelyn Chen
Katelyn Chen
Numerade Educator
04:09

Problem 25

The sequence of numbers $1,1,2,3,5,8,13,21,34,55, \ldots$. is called the Fibonacci sequence. It can be generated by setting $f_0=1, f_1=1$ and setting $f_n=f_{n-1}+f_{n-2}$ for $n \geq 2$. Notice that all numbers in the sequence are integers.
The following formulas all relate to the definition of the Fibonacci sequence. You will need to remember to use your inductive hypothesis in each case. You will also need to use the definition of the sequence: $f_n=f_{n-1}+f_{n-2}$ for $n \geq 2$.
(a) Prove that $f_0^2+f_1^2+f_2^2+\cdots+f_n^2=f_n f_{n+1}$ for $n \geq 0$.
(b) Show that $f_0+f_2+\cdots+f_{2 n}=f_{2 n+1}$ for $n \geq 0$.
(c) Prove that $f_{n-1} f_{n+1}-f_n^2=(-1)^{n+1}$ for $n \geq 1$.
(d) It is an amazing fact that $f_n$, the $n$th element of the sequence, can be given by a formula that involves $\sqrt{5}$. The formula is given by
$$
f_n=c_1 a^n+c_2 b^n,
$$
where $n \geq 0$ and
$$
c_1=\frac{1+\sqrt{5}}{2 \sqrt{5}} \quad c_2=\frac{-(1-\sqrt{5})}{2 \sqrt{5}}
$$
and
$$
a=\frac{1+\sqrt{5}}{2} \quad b=\frac{1-\sqrt{5}}{2} .
$$
It is worth mentioning that $a$ and $b$ are the two solutions to the equation $x^2=x+1$.
Use complete induction to prove that the formula is correct.

Nick Johnson
Nick Johnson
Numerade Educator

Problem 26

I Let $0<a \leq b$, where $a$ and $b$ are positive integers. Prove that $\operatorname{gcd}(a, b)=\operatorname{gcd}(b \bmod a, a)$.

Check back soon!
01:30

Problem 26

DEFINITION 3.15 max; min
Let $a$ and $b$ be real numbers. Then
$$
\max (a, b)= \begin{cases}a & \text { if } a \geq b \\ b & \text { if } a<b\end{cases}
$$
and
$$
\min (a, b)=\left\{\begin{array}{ll}
a & \text { if } a \leq b \\
b & \text { if } a>b
\end{array} .\right.
$$
Use Definition 3.15 and a proof by cases to show that $\max (\max (x, y), z)=\max (\max (x, z), y)$ with $x, y, z \in \mathbb{R}$.

Katelyn Chen
Katelyn Chen
Numerade Educator
07:18

Problem 27

Show that if $a$ and $b$ are positive integers, then $a b=\operatorname{gcd}(a, b) \cdot \operatorname{lcm}(a, b)$.

Bryan Lynn
Bryan Lynn
Numerade Educator
00:57

Problem 27

DEFINITION 3.15 max; min
Let $a$ and $b$ be real numbers. Then
$$
\max (a, b)= \begin{cases}a & \text { if } a \geq b \\ b & \text { if } a<b\end{cases}
$$
and
$$
\min (a, b)=\left\{\begin{array}{ll}
a & \text { if } a \leq b \\
b & \text { if } a>b
\end{array} .\right.
$$
Use Definition 3.15 and a proof by cases to show that if $x$ and $y$ are positive integers and $x \mid y$, then $\max (\operatorname{gcd}(x, y), y)=$ $\max (x, \operatorname{lcm}(x, y))$.

James Chok
James Chok
Numerade Educator
08:38

Problem 28

Let $x \in \mathbb{N}$. Prove: If the sum of the digits of $x$ is divisible by 3 , then $x$ is also divisible by 3 .

Bryan Lynn
Bryan Lynn
Numerade Educator

Problem 28

Use a constructive proof to show that there exist two infinite subsets, $A$ and $B$, of the integers such that $A \cap B=\emptyset$ and $A \cup B=\mathbb{Z}$.

Check back soon!

Problem 29

Suppose that $p$ and $p+2$ are both primes (called $t$ win primes). What can you say about $p \bmod 3$ ?

Check back soon!

Problem 29

Use a constructive proof to show that there must be an infinite number of Pythagorean triples. (Not necessarily primitive Pythagorean triples.)

Check back soon!
01:54

Problem 30

Prove: If $n$ is odd, then $n^2 \equiv 1 \bmod 8$.

James Chok
James Chok
Numerade Educator
01:32

Problem 30

Let $\frac{p}{q} \in \mathbb{Q}$. Prove (constructively) that there exists an integer, $n$, with $\frac{p}{q}<n$.

Nick Johnson
Nick Johnson
Numerade Educator

Problem 31

Let $q \in \mathbb{Z}$. Prove that the following are equivalent.
- 7 divides $q$
- $q^2 \neq 7 c+1, q^2 \neq 7 c+2$, and $q^2 \neq 7 c+4$ for any integer, $c$
- 7 divides $q^2$

Check back soon!
11:40

Problem 31

Prove that there exist rational numbers, $r$ and $s$, such that $r^s$ is a positive integer and $s^r$ is a negative integer.

Luis Amaro
Luis Amaro
Numerade Educator
02:13

Problem 32

Let $m, n \in \mathbb{R}$. Prove: $m^2=n^2 \leftrightarrow((m=n)$ or $(m=-n))$. Don't trivialize this problem. You need to use the zero product principle (Appendix A.1) to complete this proof.

James Chok
James Chok
Numerade Educator
04:02

Problem 32

Use a nonconstructive proof to prove the following assertion. Let $n$ be a positive integer. Then there exists a prime, $p$, with $n<p$.

Mengchun Cai
Mengchun Cai
Numerade Educator
04:30

Problem 33

Wet $S$ be a set having $n \geq 0$ elements. Prove that $S$ has $2^n$ subsets (including $b$ and $S$ itself).

JW
Julian Wong
Numerade Educator
04:02

Problem 33

Let $\frac{p}{q} \in \mathbb{Q}$. Provide a nonconstructive proof that there exists an integer, $n$, with $\frac{p}{q}<n$.

Mengchun Cai
Mengchun Cai
Numerade Educator
View

Problem 34

Prove that every odd integer can be written as the difference of two squares. (All numbers here are integers.)

Nick Johnson
Nick Johnson
Numerade Educator
01:14

Problem 34

Prove: If $A$ and $B$ are finite sets with $A \subseteq B$ and $|A| \neq|B|$, then there exists an element $x \in B$ such that $x \notin A$.

Doruk Isik
Doruk Isik
Numerade Educator
02:46

Problem 35

Let $n$ be a positive integer. Prove the following.
(a) If $n \equiv 1 \bmod 3$, then $n(n+1) \equiv 2 \bmod 3$. Otherwise, $n(n+1)=0 \bmod 3$.
(b) $n(n+1) \neq 1 \bmod 3$.

Sanchit Jain
Sanchit Jain
Numerade Educator
01:13

Problem 35

Let $f$ and $g$ be differentiable, real-valued functions. Find a counterexample to the assertion $(f g)^{\prime}(x)=f^{\prime}(x) \cdot g^{\prime}(x)$. For extra credit, find an example where the assertion is true.

Gregory Higby
Gregory Higby
Numerade Educator
02:37

Problem 36

Let $a, b$, and $c$ form a primitive Pythagorean triple (i.e., $a^2+b^2=c^2$ and no prime divides all three). Prove that $c$ is always odd, one of $a$ and $b$ is odd and the other is even.

Jay Patel
Jay Patel
Numerade Educator
00:44

Problem 36

Find a counterexample to the "Freshman Theorem": $(a+b)^n=a^n+b^n$, where $n \geq 2$ and $a$ and $b$ are any real numbers.

Rakvi .
Rakvi .
Numerade Educator
02:37

Problem 37

Let $a, b$, and $c$ form a primitive Pythagorean triple. Show that one of $a$ or $b$ is a multiple of 3 .

Jay Patel
Jay Patel
Numerade Educator
08:41

Problem 37

Use the choose method to prove: "If $p$ is a prime with $p>2$, then $p+1$ is not prime." (Hint: Use the result of Exercise 14.)

Mengchun Cai
Mengchun Cai
Numerade Educator
03:30

Problem 38

Use a proof by cases to show that if $a$ is an integer, then $a^5-a$ is divisible by 5 .

Julian Wong
Julian Wong
Numerade Educator
00:22

Problem 38

Prove or find a counterexample: Let $a$ be a positive integer and let $b, c$ be integers. If $a \mid(b c)$, then either $a \mid b$ or $a \mid c$ (or both).

Rakvi .
Rakvi .
Numerade Educator
02:09

Problem 39

Prove that the product of any four consecutive integers is divisible by 8 .

Adriano Chikande
Adriano Chikande
Numerade Educator
02:44

Problem 39

Exercise 22 of Exercises 2.5 .3 shows that $x+a=b$ cannot always be solved uniquely for $x$ if $x, a$, and $b$ are elements of a Boolean algebra. Use the choose method to prove the following. "Let $a$ and $b$ be elements of a Boolean algebra, $B$. Then $\forall x \in B,[(x+a=b) \rightarrow(x \cdot \bar{a}=b \cdot \bar{a})] . "$

WZ
Wen Zheng
Numerade Educator
03:09

Problem 40

Provide a proof for the following claim: Every integer of the form $6^{3 k}+1$ is composite, where $k$ is a positive integer.

Mohamed Mohamed
Mohamed Mohamed
Numerade Educator
View

Problem 40

Let $x$ and $y$ be integers. Prove that $x-y$ is odd if and only if $x+y$ is odd.

Nick Johnson
Nick Johnson
Numerade Educator
01:57

Problem 41

Let $A$ and $B$ be sets. Prove that $A \subseteq B$ if and only if $A-B=\emptyset$.

Adriano Chikande
Adriano Chikande
Numerade Educator
07:20

Problem 42

Let $a$ be a positive integer. Prove that $a$ is composite if and only if the sum of the positive divisors of $a$ is greater than $a+1$.

Elijah Dejonge
Elijah Dejonge
Numerade Educator
01:41

Problem 43

Let $n \in \mathbb{Z}$. Prove that the following are equivalent.
- $n$ is even
- $n+1$ is odd
- $n^2$ is even
- $(n-1)(n+1)$ is odd

Adriano Chikande
Adriano Chikande
Numerade Educator

Problem 44

Let $p \in \mathbb{Z}$. Prove that the following are equivalent.
- $p$ is a prime
- for all $a, b \in \mathbb{Z}, p \mid(a b) \rightarrow[(p \mid a) \vee(p \mid b)]$
- for all $d \in \mathbb{Z}$ with $1<d<p^2,\left(d \mid p^2\right) \rightarrow(d=p)$

Check back soon!

Problem 45

Suppose that $d$ and $c$ are both common divisors of $a$ and $b$ and suppose that $c \nmid d$. The following argument is an attempt to prove that $d c$ is a common divisor of $a$ and $b$. You have a twofold task:
(a) Find a counterexample to the assertion.
(b) Find the error in the supposed proof.
Since $d$ is a common divisor of $a$ and $b$, there are integers, $x$ and $y$, such that $a=d x$ and $b=d y$. Since $c$ is a common divisor of $a$ and $b$, but $c \nmid d$, it must be that $c \mid x$ and $c \mid y$. Consequently, there are integers, $u$ and $v$, such that $x=c u$ and $y=c v$. Thus, $a=d x=d(c u)=(d c) u$ and $b=d y=d(c v)=(d c) v$. Therefore, $d c$ is a common divisor of $a$ and $b$.

Check back soon!