- #1
patfan7452
- 3
- 0
Hey all,
Can anyone prove this theorem?
Let N (natural numbers) ---> X be an onto function. Then X is countable.
I've been staring at it for 3 hours and really can't come up with anything. Any help?
Can anyone prove this theorem?
Let N (natural numbers) ---> X be an onto function. Then X is countable.
I've been staring at it for 3 hours and really can't come up with anything. Any help?