Sujet : Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary)
De : noreply (at) *nospam* example.org (joes)
Groupes : sci.logicDate : 08. Dec 2024, 21:22:09
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <95183b4d9c2e32651963bac79965313ad2bfe7e8@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Tue, 03 Dec 2024 12:10:53 +0100 schrieb WM:
On 03.12.2024 11:03, Mikko wrote:
I understand mathematics
Hardly, though you may have the impression.
Proof: You cannot understand that the function f(10n) = n from D = {10n
| n ∈ ℕ} to ℕ = {1, 2, 3, ...} is not a bijection because for every
initial segment {1, 2, 3, ..., n} of ℕ there are too few numbers of the
form 10n that can be paired with numbers n.
Wow. For every segment there are numbers {10, 20, …, 10n}.
-- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:It is not guaranteed that n+1 exists for every n.
…