Chapter 9: Problem 4
Prove that for all integers \(m\) and \(n, m-n\) is even if, and only if, both \(m\) and \(n\) are even or both \(m\) and \(n\) are odd.
/*! 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 9: Problem 4
Prove that for all integers \(m\) and \(n, m-n\) is even if, and only if, both \(m\) and \(n\) are even or both \(m\) and \(n\) are odd.
All the tools & learning materials you need for study success - in one app.
Get started for free
. The congruence modulo 3 relation, \(T\), is defined from \(\mathbf{Z}\) to \(\mathbf{Z}\) as follows: For all integers \(m\) and \(n, m T n \Leftrightarrow 3 \mid(m-n)\). a. Is \(10 T\) l? Is \(1 T\) lo? Is \((2,2) \in T\) ? Is \((8,1) \in T\) ? b. List five integers \(n\) such that \(n T 0\). c. List five integers \(n\) such that \(n T 1\). d. List five integers \(n\) such that \(n T 2\). \(\boldsymbol{H}\) e. Make and prove a conjecture about which integers are related by \(T\) to 0 , which integers are related by \(T\) to 1 , and which integers are related by \(T\) to 2 .
\(F(x)=\left\lfloor x^{1 / 2}\right\rfloor\) for all real numbers \(x\)
Show that the function \(g: \mathbf{R} \rightarrow \mathbf{R}\) defined by the formula \(g(x)=-(x / 3)+1\) is decreasing on the set of all real numbers.
Define a binary relation \(S\) on \(B=\\{a, b, c, d\\}\) by \(S=\) \(\\{(a, b),(a, c),(b, c),(d, d)\\}\).
Exercises \(36-39\) refer to the following algorithm to compute the value of a real polynomial. Algorithm 9.3.3 Term-by-Term Polynomial Evaluation [This algorithm computes the value of the real polynomial \(a[n] x^{n}+a[n-1] x^{n-1}+\cdots+a[2] x^{2}+a[1] x+a[0]\) by computing each term separately, starting with \(a[0]\), and adding it on to an accumulating sum.] Input: \(n\) [a nonnegative integer], \(a[0], a[1], a[2], \ldots, a[n]\) [an array of real numbers], \(x[\) a real number \(]\) Algorithm Body: polyval := \(a[0]\) for \(i:=1\) to \(n\) term : = \(a[i]\) for \(j:=1\) to \(i\) term \(:=\) term \(\cdot x\) next \(j\) polyval := polyval + term next \(i\) [At this point polyval \(=a[n] x^{n}+a[n-1] x^{n-1}\) \(\left.+\cdots+a[2] x^{2}+a[1] x+a[0] .\right]\) Output: polyval [a real number] Let \(s_{n}=\) the number of additions and multiplications that must be performed when Algorithm \(9.3 .3\) is executed for a polynomial of degree \(n\). Express \(s_{n}\) as a function of \(n\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.