Sujet : Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary)
De : wolfgang.mueckenheim (at) *nospam* tha.de (WM)
Groupes : sci.logicDate : 09. Dec 2024, 15:40:48
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vj6vhh$elqh$2@dont-email.me>
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
User-Agent : Mozilla Thunderbird
On 08.12.2024 21:22, joes wrote:
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}.
But for every segments more are needed: {1, 2, 3, ..., 10n}
Regards, WM
…