A set is countable if it can be put into a one-to-one correspondence with the natural numbers. Countably infinite sets have an infinite number of elements and can be put into a one-to-one correspondence with the natural numbers. Georg Cantor proved that there are uncountable sets, which cannot be put into a one-to-one correspondence with the natural numbers.
UC Berkeley
Fall 2022
CS 70 presents key ideas from discrete mathematics and probability theory with emphasis on their application in Electrical Engineering and Computer Sciences. It addresses a variety of topics such as logic, induction, modular arithmetic, and probability. Sophomore mathematical maturity and programming experience equivalent to an Advanced Placement Computer Science A exam are prerequisites.
No concepts data
+ 32 more concepts