Deutsch   English   Français   Italiano  
<c46775b30460bc564b3fe7bd1b838713829024f8@i2pn2.org>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.math
Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers
 (extra-ordinary, effectively)
Date: Mon, 30 Dec 2024 11:08:21 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <c46775b30460bc564b3fe7bd1b838713829024f8@i2pn2.org>
References: <vg7cp8$9jka$1@dont-email.me> <vjv6uv$2dra0$1@dont-email.me>
 <31180d7e-1c2b-4e2b-b8d6-e3e62f05da43@att.net> <vk1brk$2srss$7@dont-email.me>
 <bb80c6c5-04c0-4e2d-bb21-ac51aab9e252@att.net> <vk23m7$31l8v$1@dont-email.me>
 <bce1b27d-170c-4385-8938-36805c983c49@att.net> <vk693m$f52$2@dont-email.me>
 <a17eb8b6-7d11-4c59-b98c-b4d5de8358ca@att.net> <vk7dmb$7mh2$2@dont-email.me>
 <b72490c1-e61a-4c23-a3a5-f624b2c084e4@att.net> <vk8tbq$j9h1$1@dont-email.me>
 <bd7dfdc7-6471-4fe6-b078-0ca739031580@att.net> <vklumc$3htmt$1@dont-email.me>
 <c03cf79d-0572-4b19-ad92-a0d12df53db9@att.net>
 <n9CdnR02SsevtPL6nZ2dnZfqnPidnZ2d@giganews.com>
 <45a632ed-26cc-4730-a8dd-1e504d6df549@att.net> <vkpa98$dofu$2@dont-email.me>
 <3d2fe306aa299bc78e94c14dadd21645d8db9829@i2pn2.org>
 <vkr8sq$t59a$2@dont-email.me>
 <d4669f26483b01c8a43dfd3ac4b61ab4a42bf551@i2pn2.org>
 <vksikk$17fjt$1@dont-email.me>
 <aa2941e93e806f1dda55d563dd062db67eb879f1@i2pn2.org>
 <vktmi3$1ia1u$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 30 Dec 2024 16:08:21 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1195895"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vktmi3$1ia1u$1@dont-email.me>
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 3492
Lines: 48

On 12/30/24 3:44 AM, WM wrote:
> On 30.12.2024 01:36, Richard Damon wrote:
>> On 12/29/24 5:31 PM, WM wrote:
> 
>>> My theorem: Every union of FISONs which stay below a certain 
>>> threshold stays below that threshold.
>>> Find a counterexample. Don't claim it but prove it. Fail.
> 
>> But what does that prove?
> 
> That proves the existence of dark numbers.

How?

It shows that there are numbers you didn't look at, but you admit to not 
looking at all the numbers.

>>
>> The finite numbers are finite, and that is it.
> 
> FISONs do not grow by unioning them. All FISONs and their unions stay 
> below 1 % of ℕ.

So, all Natural Numbers are finite, but the "union" of them (putting 
them *ALL* into a set) creates an infinite set.

> 
> Proof: Every FISON that is multiplied by 100 remains a FISON that can be 
> multiplied by 100 without changing this property.
> 
> If ℕ is an actually infinite set then it is not made by FISONs.

Who said it is made of FISONs, It could be said that it is the union of 
*ALL* of the infinite set of FISONs, but the union of an infinte set of 
things can be bigger than any member of that infinite set.

> 
> Regards, WM
> 
> 


All you are doing is showing your utter stupidity of trying to use the 
logic of finite sets when you are working with an infinte set, and that 
logic just blows itself up into smithereens by doing so, and takes you 
out with it,

Your "dark numbers" are just the result of the black hole created by 
that explosion cause by your inconsistancies.