Can anyone tell me how I could show that the following set is countable?

Natural numbers and the integers not divisible by 3?

Printable View

- February 8th 2009, 11:58 AMvexikedCardinality
Can anyone tell me how I could show that the following set is countable?

Natural numbers and the integers not divisible by 3? - February 8th 2009, 12:13 PMJhevon
Recall the theorem that the union of countable sets is countable (in fact, the countable union of countable sets is countable).

note that the set we wish to prove is countable can be written as

now show that each of these are countable, shouldn't be that hard. then apply the theorem

you can show a set is countable by showing that there exists a bijection between the set and the natural numbers. - February 8th 2009, 02:53 PMvexiked
I'm sorry but I don't follow. All I have to do is find a function that will ouput all integers not divisible by 3? Maybe an example would push me in the right direction. Thanks for the help!

- February 8th 2009, 02:58 PMJhevon
for each set that you want to show is countable, find a one-to-one and onto function from the natural numbers to the set.

**example**, how to we know that the set of nonnegative even numbers is countable?

well, let E be the set of nonnegative even numbers.

the function given by for is one-to-one and onto. - February 8th 2009, 03:23 PMMoo
Hello,

You can consider only the negative integers not divisible by 3, because the positive ones would be in

So they're in the form and , for any n in

Define the function :

prove that this is an injective function :P