Chapter 3: Problem 11
Prove that every integer is a rational number.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 3: Problem 11
Prove that every integer is a rational number.
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
a. Rewrite the following theorem in the form \(\forall \longrightarrow\) if then b. Fill in the blanks in the proof, Theorem: The sum of any even integer and any odd integer is odd. Proof: Suppose \(m\) is any even integer and \(n\) is (a) By definition of even, \(m=2 r\) for some \((b)\), and by definition of odd, \(n=2 s+1\) for some integer \(s\). By substitution and algebra, \(m+n=\underline{(c)}=2(r+s)+1 .\) Since \(r\) and \(s\) are both integers, so is their sum \(r+s\). Hence \(m+n\) has the form 2 . (some integer) \(+1\), and \(s o\) (d) by definition of odd.
For all nonnegative real numbers \(a\) and \(b, \sqrt{a b}=\sqrt{a} \sqrt{b}\). (Note that if \(x\) is a nonnegative real number, then there is a unique nonnegative real number \(y\), denoted \(\sqrt{x}\), such that \(\left.y^{2}=x_{0}\right)\)
Definition: The least common multiple of two nonzero integers \(a\) and \(b\), denoted \(\operatorname{lcm}(a, b)\), is the positive integer \(c\) such that a. \(a \mid c\) and \(b \mid c\) b. for all integers \(m\), if \(a \mid m\) and \(b \mid m\), then \(c \mid m\). Prove that for all positive integers \(a\) and \(b\). \(\operatorname{gcd}(a, b) \cdot \operatorname{lcm}(a, b)=a b\).
The difference of any two odd integers is even.
Let \(N=2 \cdot 3 \cdot 5 \cdot 7+1\). What remainder is obtained when \(N\) is divided by 2 ? 3 ? 5 ? 7 ? Is \(N\) prime? Justify your answer.
What do you think about this solution?
We value your feedback to improve our textbook solutions.