Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 2 - Section 2.5 - Cardinality of Sets - Exercises - Page 177: 28

Answer

$ \mathbf{Z}^{+} \times \mathbf{Z}^{+} $ is countable.

Work Step by Step

Let us define the function $f$ as: $f : \mathbf{Z}^{+} \times \mathbf{Z}^{+} \rightarrow \mathbf{Z}^{+}, f(m, n)=2^{m} \cdot 3^{n}$ Check that $f$ is one-to-one: if $f(a,b)$=$f(m,n)$, then $2^{a} \cdot 3^{b}=2^{m} \cdot 3^{n}$ Since $2$ and $3$ are premise: $\begin{aligned} 2^{a} &=2^{m} \\ 3^{b} &=3^{n} \end{aligned}$ Since the bases are the same, the powers also have to be the same (else the positive integers cannot be the same). $a=m$ $b=n$ By the definition of one-to-one, we have shown that$f$ is a one-to-one function. Also as we know that there is a one-to-one function from $A$ to $B$ if and only if $$ |A| \leq|B| $$ $$ \left|\mathbf{Z}^{+} \times \mathbf{Z}^{+}\right| \leq\left|\mathbf{Z}^{+}\right| $$ A sert $A$ is countable if and only if $ |A| \leq\left|\mathbf{Z}^{+}\right| $. Thus we have shown that $ \mathbf{Z}^{+} \times \mathbf{Z}^{+} $ is countable.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.