1. [10 Pts] Show that the following sets are countably infinite, by defining a bijection between N (or Z+) and that set. You do not need to prove that your function is bijective. (a) [5 Pts] the set of integers divisible by 5 (b) [5 Pts] A x Z+ where A = {2, 3}
Added by Kelsey H.
Close
Step 1
This function is a bijection between the set of natural numbers and the set of integers divisible by 5. For every natural number n, f(n) is an integer divisible by 5, and for every integer m divisible by 5, m/5 is a natural number. Show more…
Show all steps
Your feedback will help us improve your experience
Vincenzo Zaccaro and 71 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 E be the set of all positive even integers. Prove that E is countably infinite by defining a map f : Z+ -> E and showing that it is a bijection.
Sachchidanand P.
Prove that the set of integers Z is countable by constructing a bijection f: N → Z.
Adi S.
Prove. The set of odd positive integers is countably infinite.
Functions and Matrices
Properties of Functions
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