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

At my exam I had to proof the title of this topic. I now know that it can easily be done by making a bijection between the two, but I still want to know why I didn't receive any points for my answer, or better stated, if there is still a way to proof the statement from my work.

My work:

2^N > N (Cantor)

2^N x 2^N > N x N

Knowing that |N x N| = |N| it follows that |2^N x 2^N| = |2^N|.

I know that I didn't really give an explanation in that last step, but I still want to know if and how it's correct.

Thanks in advance!

**Physics Forums - The Fusion of Science and Community**

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

# Proof of |2^N x 2^N| = |2^N| with N the natural numbers

Tags:

Loading...

Similar Threads - Proof |2^N 2^N| | Date |
---|---|

I An easy proof of Gödel's first incompleteness theorem? | Mar 6, 2018 |

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

A A "Proof Formula" for all maths or formal logic? | Apr 19, 2017 |

I Regarding Cantor's diagonal proof. | Feb 28, 2017 |

Proof by Induction: 2^n < n! | Jan 11, 2005 |

**Physics Forums - The Fusion of Science and Community**