Editing Talk:1516: Win by Induction
Please sign your posts with ~~~~ |
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 2: | Line 2: | ||
:Makes sense to me. I didn't even think of double yolks until you mentioned it here. [[Special:Contributions/173.245.50.89|173.245.50.89]] 09:04, 24 April 2015 (UTC)BK201 | :Makes sense to me. I didn't even think of double yolks until you mentioned it here. [[Special:Contributions/173.245.50.89|173.245.50.89]] 09:04, 24 April 2015 (UTC)BK201 | ||
::Seconded. --[[Special:Contributions/188.114.110.52|188.114.110.52]] 14:34, 24 April 2015 (UTC) | ::Seconded. --[[Special:Contributions/188.114.110.52|188.114.110.52]] 14:34, 24 April 2015 (UTC) | ||
− | |||
The explanation currently says that doubling makes it uncountably infinite. I'm pretty sure that doubling at each step (or every few steps) is still a countable infinite set. Proof here: http://practicaltypography.com/the-infinite-pixel-screen.html (see section "The internet demands a recount", because the first attempt is wrong). We can also prove it using the same argument as when proving that N x N is countable infinite (making zig-zag), but in this case making a breadth-first search of the tree of Pikachus: map 1 to the first Pikachu, map 2 and 3 to the two Pikachus at the second level, map 4, 5, 6, 7 to the four Pikachus at the third level, map (2^(n-1))…((2^n) - 1) to the 2^(n-1) Pikachus at level n. {{unsigned ip|108.162.229.177}} | The explanation currently says that doubling makes it uncountably infinite. I'm pretty sure that doubling at each step (or every few steps) is still a countable infinite set. Proof here: http://practicaltypography.com/the-infinite-pixel-screen.html (see section "The internet demands a recount", because the first attempt is wrong). We can also prove it using the same argument as when proving that N x N is countable infinite (making zig-zag), but in this case making a breadth-first search of the tree of Pikachus: map 1 to the first Pikachu, map 2 and 3 to the two Pikachus at the second level, map 4, 5, 6, 7 to the four Pikachus at the third level, map (2^(n-1))…((2^n) - 1) to the 2^(n-1) Pikachus at level n. {{unsigned ip|108.162.229.177}} |