Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>
Newsgroups: sci.math
Subject: Re: The non-existence of "dark numbers"
Date: Thu, 27 Mar 2025 13:19:00 -0700
Organization: A noiseless patient Spider
Lines: 21
Message-ID: <vs4brl$10ibp$1@dont-email.me>
References: <vqrbtd$1chb7$2@solani.org>
 <c0de7504-7d17-42f1-83e8-8767c0859c0c@att.net> <vrj5nh$12273$1@dont-email.me>
 <efbe60c5-6691-4fd6-8638-589fd95ec8a4@att.net> <vrkabi$233at$1@dont-email.me>
 <f32ed217-7f7d-4e03-8a10-58fc26cbbb50@att.net> <vrlvah$3khef$1@dont-email.me>
 <555d7095-81a0-4576-adac-f2aa8327f4df@att.net> <vrpg35$2q4gr$1@dont-email.me>
 <8397e10f-36cb-43c6-8d2b-e4d20809ee83@att.net> <vrpo4r$3002f$3@dont-email.me>
 <4b83f1c2-c16f-40b4-a5b6-68991e3c230c@att.net> <vrsc49$1gv1c$2@dont-email.me>
 <440ff556-a769-482e-ad2a-064af14c5781@att.net> <vrulap$3l4i0$2@dont-email.me>
 <369e62e9-93e6-4256-96ed-f9d8489aa017@att.net> <vrv307$3vgl7$4@dont-email.me>
 <5004d400-7c2e-4d59-ad66-5986a416ef89@att.net> <vrv9oe$8plq$3@dont-email.me>
 <411d5c64-ddb6-4655-a264-2149d054ff7d@att.net> <vs1hhj$2bn9k$1@dont-email.me>
 <94fa0364396567adcb4e87213ba7392c45ed8a1d@i2pn2.org>
 <vs1msv$2c93u$1@dont-email.me>
 <5355732a3f22baa4483b5718dd1c74f90362f653@i2pn2.org>
 <vs4a58$eulg$3@solani.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Thu, 27 Mar 2025 21:19:01 +0100 (CET)
Injection-Info: dont-email.me; posting-host="fbc29af1887b2a280464b9343f8aeb59";
	logging-data="1067385"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/eXjdpaWqo0d2wV5hYVFFBRiOlw+8sAGk="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:x85a/H+6v8jOi9G83bO2navse6s=
Content-Language: en-US
In-Reply-To: <vs4a58$eulg$3@solani.org>

On 3/27/2025 12:50 PM, WM wrote:
> Am 27.03.2025 um 15:58 schrieb joes:
>> Am Wed, 26 Mar 2025 21:09:03 +0100 schrieb WM:
> 
>>>> At finite steps, but not in the limit.
>>> Countability is proved without limits. Bijections are one-to-one without
>>> limit.
>> I have no idea what you are talking about. What can be proved to be
>> countable without resorting to limits?
> 
> Limits deviate from countability.
> 
>> I didn't say anything about
>> bijections not being one-to-one, nor about them having limits???
>> The transformation from the initial to the final matrix can not be
>> achieved in finitely many steps.
> 
> That is true but contradicts Cantor's theory according to which every 
> pair has a finite index. Every finite index n has only n-1 predecessors.

Iirc, Cantor Pairing works with any unsigned integer.