Chapter 6: Problem 24
Prove the following statements using any method from Chapters 4,5 or 6 . The number \(\log _{2} 3\) is irrational.
Chapter 6: Problem 24
Prove the following statements using any method from Chapters 4,5 or 6 . The number \(\log _{2} 3\) is irrational.
All the tools & learning materials you need for study success - in one app.
Get started for freeUse the method of proof by contradiction to prove the following statements. (In each case, you should also think about how a direct or contrapositive proof would work. You will find in most cases that proof by contradiction is easier.) If \(A\) and \(B\) are sets, then \(A \cap(B-A)=\varnothing\).
Use the method of proof by contradiction to prove the following statements. (In each case, you should also think about how a direct or contrapositive proof would work. You will find in most cases that proof by contradiction is easier.) For every \(n \in \mathbb{Z}, 4 \nmid\left(n^{2}+2\right)\)
For every \(n \in \mathbb{Z}, 4 \nmid\left(n^{2}+2\right)\). Suppose \(a, b \in \mathbb{Z}\). If \(4 \mid\left(a^{2}+b^{2}\right),\) then \(a\) and \(b\) are not both odd.
Prove the following statements using any method from Chapters 4,5 or 6 . Explain why \(x^{2}+y^{2}-3=0\) not having any rational solutions (Exercise 20 ) implies \(x^{2}+y^{2}-3^{k}=0\) has no rational solutions for \(k\) an odd, positive integer.
Use the method of proof by contradiction to prove the following statements. (In each case, you should also think about how a direct or contrapositive proof would work. You will find in most cases that proof by contradiction is easier.) Suppose \(n \in \mathbb{Z}\). If \(n^{2}\) is odd, then \(n\) is odd.
What do you think about this solution?
We value your feedback to improve our textbook solutions.