1. Follow the method of Example 7.6.2 on page 415 of the textbook to show that the set of odd integers is countable.
Let Zodd represent the set of odd integers, and define a
function h: ZZodd as follows: let h(x)
= 2x + 1 for all integers x.
Show that the function h is one-to-one and onto and is therefore a one-to-one correspondence.