Countable set/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Jitse Niesen (New page: {{subpages}} ==Parent topics== {{r|Set}} {{r|Set theory}} <!-- ==Subtopics== List topics here that are included by this topic. --> ==Other related topics== {{r|Cardinality}} {{r|Natura...) |
No edit summary |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
==Parent topics== | == Parent topics == | ||
{{r|Set}} | |||
{{r|Cardinality}} | |||
{{r|Set (mathematics)}} | |||
{{r|Set theory}} | {{r|Set theory}} | ||
== Subtopics == | |||
==Subtopics== | |||
{{r|Aleph-0}} | |||
- | |||
==Other related topics== | ==Other related topics== | ||
{{r| | |||
{{r|Infinity}} | |||
{{r|Natural number}} | {{r|Natural number}} | ||
{{r|Galileo's paradox}} | {{r|Galileo's paradox}} | ||
{{r|Hilbert's hotel}} | {{r|Hilbert's hotel}} | ||
{{r|Cantor's diagonal argument}} | |||
==Articles related by keyphrases (Bot populated)== | |||
{{r|Prime Number Theorem}} | |||
Latest revision as of 11:01, 2 August 2024
- See also changes related to Countable set, or pages that link to Countable set or to this page or whose text contains "Countable set".
Parent topics
- Cardinality [r]: The size, i.e., the number of elements, of a (possibly infinite) set. [e]
- Set (mathematics) [r]: Informally, any collection of distinct elements. [e]
- Set theory [r]: Mathematical theory that models collections of (mathematical) objects and studies their properties. [e]
Subtopics
- Infinity [r]: Add brief definition or description
- Natural number [r]: An element of 1, 2, 3, 4, ..., often also including 0. [e]
- Galileo's paradox [r]: The observation that there are fewer perfect squares than natural numbers but also equally many. [e]
- Hilbert's hotel [r]: A fictional story which illustrates certain properties of infinite sets. [e]
- Cantor's diagonal argument [r]: Proof due to Georg Cantor showing that there are uncountably many sets of natural numbers. [e]
- Prime Number Theorem [r]: The number of primes up to some limit X is asymptotic to X divided by the logarithm of X. [e]