Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.math
Subject: Re: The set of necessary FISONs
Date: Tue, 18 Feb 2025 07:25:13 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <6ce2f2978a7afa0e86094debd2e5f1f0eb16f266@i2pn2.org>
References: <vmo1bs$1rnl$1@dont-email.me> <vo7c1q$7ne$3@dont-email.me>
 <0d24c3fd-cd63-4e21-9dd4-ab1360560b09@att.net>
 <cc879e12-d325-48b6-be78-87b8b36cb50d@att.net> <vo8jr7$7mh2$2@dont-email.me>
 <79920977-902d-4f59-a11c-497383221c82@att.net> <voa1r5$ib75$1@dont-email.me>
 <468b9c37-ba93-485c-8685-4b320e168251@att.net> <vocig1$15cth$1@dont-email.me>
 <68bab5c2-50d3-43fc-be0d-51e01c5952bb@att.net> <vof5e4$1n7gr$1@dont-email.me>
 <a52c053a-8537-4f77-849d-aba3cf51283f@att.net> <vog83h$1rvmp$4@dont-email.me>
 <1e5cb0d4-f447-4fa7-b1e9-8056b03d27a2@att.net> <vohp3q$28sjf$1@dont-email.me>
 <b9b0c514-a71c-4cd8-b291-a4847db04795@att.net> <vokmsi$2t0ls$1@dont-email.me>
 <5f7c94ab-c633-40be-a7bc-9ed8c3795501@att.net> <vonefq$3eut3$2@dont-email.me>
 <83ca74c3-4714-43a2-afe5-ec9e70a5d828@att.net> <voq9lv$28vf$2@dont-email.me>
 <7ab7cbcd-2bcc-45e8-9cec-e97addda22f9@att.net> <vp034d$188u3$2@dont-email.me>
 <4b135882105d3e0445670cc5e4f5cd4540df4c80@i2pn2.org>
 <vp1lrb$1l6cj$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 18 Feb 2025 12:25:13 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="617984"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vp1lrb$1l6cj$1@dont-email.me>
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 2726
Lines: 24

On 2/18/25 5:02 AM, WM wrote:
> On 18.02.2025 04:02, Richard Damon wrote:
> 
>> We can build a sufficent set from non-required FISONs, just like we 
>> can factor 36 from non-required factors.
> 
> We can go through the factors and find the first required factor 6.

6 isn't a required factor, as you can use 4 * 9.

It seems you don't know what REQURIED means.

> We can go through the FISONs and find that a FISON F(n) changing
> U({F(1), F(2), F(3), ...} \ {F(1), F(2), ..., F(n)}) = ℕ
> does not exist.
> 
> The belief that some smaller FISONs would help shows missing brain.
> 
> Regards, WM

Nope, it shows that your brain got lost in the explosion of your logic 
system when it blew itself to smithereens on the contradictions it faced.

The base problem he is the assumption that there needs to be a required 
subset, when there isn't.