Sujet : Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary)
De : invalid (at) *nospam* example.invalid (Moebius)
Groupes : sci.mathDate : 26. Dec 2024, 05:09:44
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vkiku8$2pt4u$4@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
User-Agent : Mozilla Thunderbird
Am 26.12.2024 um 05:02 schrieb Chris M. Thomasson:
On 12/24/2024 4:07 PM, Ross Finlayson wrote:
On 12/24/2024 12:27 PM, Chris M. Thomasson wrote:
Cantor's Pairing works with any unsigned integer.
>
No, it works with two copies of all the integers, [...]
It works with any unsigned integer.
It works especially with the (elements in the) two sets {0, 2, 4, ...} and {1, 3, 5, ...}:
n <-> n+1 .
P := {(n, n+1) : n e {0, 2, 4, ...}} .
Then P is {(0, 1}, (2, 3}, (4, 5}, ...}.
.
.
.