Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <31a3690769165467190929addc8f1308fc8d6d66@i2pn2.org>
Deutsch   English   Français   Italiano  
<31a3690769165467190929addc8f1308fc8d6d66@i2pn2.org>

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

Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: joes <noreply@example.org>
Newsgroups: sci.math
Subject: Re: The set of necessary FISONs
Date: Sun, 2 Feb 2025 17:41:05 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <31a3690769165467190929addc8f1308fc8d6d66@i2pn2.org>
References: <vmo1bs$1rnl$1@dont-email.me> <vn7r2r$q7sl$2@dont-email.me>
	<814297ada299a65bb9f427ddec5646afcc94be9f@i2pn2.org>
	<vn85es$u7pk$2@dont-email.me>
	<f753327bd316219fc9f04a8626b725956bfe8c9a@i2pn2.org>
	<vna675$1ng1j$1@dont-email.me>
	<b9a5e6e3397b079bfb37f810d53d3491a400b3d6@i2pn2.org>
	<vnasam$1s6ha$3@dont-email.me>
	<95ac176b19f1c24772a2ee73b3a12fe494da1241@i2pn2.org>
	<vncqhg$29v5v$3@dont-email.me> <vncsrh$2anj5$1@dont-email.me>
	<993b552f-7ab8-4a0b-a308-4748f20efb95@tha.de> <vndcal$2dft2$1@dont-email.me>
	<vnffdk$2rv3s$3@dont-email.me>
	<9e3c198cdfa1b264a1e30723ff18538f02e59af0@i2pn2.org>
	<vngjss$31ubc$1@dont-email.me>
	<d89c793e1e0a14f531ef1699066785dfd6b4b98b@i2pn2.org>
	<vni886$3f2gg$2@dont-email.me>
	<2f96b3bb86a9cd97239dbb6dfefe1a110cde63f5@i2pn2.org>
	<vnl3pu$3ae7$1@dont-email.me>
	<9906c80826629d0969b3f6eb9f731c69465faaa6@i2pn2.org>
	<vnl87r$3ae7$3@dont-email.me>
	<eb1332f289a53b5f85af64dcb1e2c9a584edced8@i2pn2.org>
	<vnnjji$knr7$6@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 2 Feb 2025 17:41:05 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2280353"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM";
User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a
 git.gnome.org/pan2)
X-Spam-Checker-Version: SpamAssassin 4.0.0

Am Sun, 02 Feb 2025 12:06:26 +0100 schrieb WM:
> On 01.02.2025 19:42, joes wrote:
>> Am Sat, 01 Feb 2025 14:40:12 +0100 schrieb WM:
>>> On 01.02.2025 14:16, joes wrote:
>>>> Am Sat, 01 Feb 2025 13:24:31 +0100 schrieb WM:
> 
>>>>> When n can be deleted, then n+1 can be deleted. Nothing remains.
>>>> It works this way: If n can be removed, n AND n+1 can be removed.
>>>> But it doesn’t work this way: „If n can be left out, all n can be.”
>>> Which one cannot be removed?
>> Wrong question. You cannot remove infinitely many. „Infinitely many”
>> is not a natural number.
> Mathematical induction is a method for proving that a statement P(n) is
> true for every natural number n that is, that the infinitely many cases
> P(0),P(1),P(2),P(3),... all hold. [Wikipedia]
And you want the wrong P(ω) to hold, but you cannot remove infinitely
many segments. This is different from all P(n) which together say
you can remove any finite *number of* segments (not the segments
themselves). Do you get that? There is no infinite segment, but
there *are* infinitely many.

-- 
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.