Rationals are Countable by Cantor Snake
A set is said to be countable if it can be put in bijection with the positive integers. It is a remarkable fact that a set with more than "double" the number of elements, namely the integers, is countable. Even more remarkable is that the rational numbers are countable. We prove the latter in this video using a counting method whose visualization is called the Cantor snake. Like, subscribe, and share! To find out more about us: Visit https://existsforall.com to check out our services Get our Rigorous Elementary Mathematics books on Amazon: https://www.amazon.com/dp/B0DGDNK6TM?... Copyright © Existsforall Academy Inc. All rights reserved.
▶︎
Real Numbers are Uncountable by Cantor Diagonalization
▶︎
Integers & Rationals are both infinite but is it the SAME infinity?
▶︎
1.11.3 Countable Sets: Video
▶︎
Cantor's Diagonal Argument: The rationals and reals have different sizes?!?!?
▶︎
The Obviously True Theorem No One Can Prove
▶︎
Countable & Uncountable Infinities
▶︎
The Most Controversial Idea In Math
▶︎
Why you can't solve quintic equations (Galois theory approach) #SoME2
▶︎
Measuring the Rationals
▶︎
Real Analysis | The countability of the rational numbers.
▶︎
R is uncountable
▶︎
1.11.4 Cantor's Theorem: Video
▶︎
Infinity is bigger than you think - Numberphile
▶︎
Introduction to the Cardinality of Sets and a Countability Proof
▶︎
Einstein OBSERVED Ramanujan's Work And Saw Mathematics That Shouldn't Exist
▶︎
The Oldest Unsolved Problem in Math
▶︎
Pushing Simulations to the LIMIT to Find Order in Chaos
▶︎
An "obvious" theorem about infinite sets (The Cantor-Bernstein-Schröder Theorem)
▶︎
I turned an old van into a 2-STORY tiny house
▶︎