Sujet : Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary)
De : wolfgang.mueckenheim (at) *nospam* tha.de (WM)
Groupes : sci.logicDate : 13. Dec 2024, 18:00:59
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vjhp8b$3gjbv$1@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 13.12.2024 13:11, Richard Damon wrote:
Note, the pairing is not between some elements of N that are also in D, with other elements in N, but the elements of D and the elements on N.
Yes all elements of D, as black hats attached to the elements 10n of ℕ, have to get attached to all elements of ℕ. There the simple shift from 10n to n (division by 10) is applied. >
You just don' understand what it means to PAIR elements of two sets.
That pairs the elements of D with the elements of ℕ. Alas, it can be proved that for every interval [1, n] the deficit of hats amounts to at least 90 %. And beyond all n, there are no further hats.
Regards, WM
…