Hey all,(adsbygoogle = window.adsbygoogle || []).push({});

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?

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Proof of a Countability Theorem

Loading...

Similar Threads for Proof Countability Theorem |
---|

I Non-countable uniform spaces probability |

I Proof that BB(k) grows faster than any computable function |

I An easy proof of Gödel's first incompleteness theorem? |

I Countability of ℚ |

I Cantor's decimal proof that (0,1) is uncountable |

**Physics Forums | Science Articles, Homework Help, Discussion**