Word Count : 188

---

The set of integers ( \mathbb{Z} = { \dots, -3, -2, -1, 0, 1, 2, 3, \dots } ) can be shown to be countable by explicitly constructing a one-to-one correspondence (bijection) with the set of natural ___ _______ _____ ______ ____ __________.
____ _____ ____ _________ __________ ________ _______ _______ __________ ______.
__________ ___ _______ _____ __________ _______.
______ _________ ___ _______ ___ ______ ____ ___ ____ _______ ____.
____ _____ _____ ____ ________ __________ _________ ________ _______ __________.
__________ ____ ____ ___ ________ _________ _________.
____ ______ _________ _____ _________ _____ _________ ________ _____.
_______ _________ ______ _______ __________ _______ _________ _______ _________.
___ _______ _______ ___ _____ ___.
___ ___ _____ _____ _________ ______ _____ ___ ___.
_____ ___ _______ _________ ___ ________ ___ ________ ________.
______ _____ __________ ___ ______ __________ ____ ____ _______.
__________ ___ _______ __________ ________.
__________ _________ __________ _______ ___ _____ ____ ______.
_____ _____ _______ ________ ________.
_________ _______ ____ __________ ____ ______ _____ __________ _______ ___ _________ __________.
____ __________ ________ __________ ________ _________ _______ _________.
________ _____ ________ ___ ________ ______ ___ _______ ___.
_________ _____ ____.
Get Full Answer on WhatsApp