Prove that the set of integers Z is countable by constructing a bijection f: N → Z.
Added by Brenda B.
Step 1
Step 1: Define the function f: N -> Z as follows: f(n) = n/2 if n is even f(n) = -(n+1)/2 if n is odd Show more…
Show all steps
Close
Your feedback will help us improve your experience
Adi S and 95 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let X, Y, Z be sets. Find a bijection (with proof) between X Ă— (Y Ă— Z) and X Ă— Y Ă— Z.
Oscar B.
Show that the set {0, 1,2,3} * N is countably infinite by defining a bijection between N(or Z+) and {0, 1, 2,3}*N
Adi S.
Show that the set $\mathbf{Z}^{+} \times \mathbf{Z}^{+}$ is countable.
Basic Structures: Sets, Functions, Sequences, Sums,and Matrices
Cardinality of Sets
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD