Deutsch English Français Italiano |
<9a719dd0430737a83ec106b509069a1c89bf407c@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: joes <noreply@example.org> Newsgroups: sci.math Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary) Date: Sat, 28 Dec 2024 15:44:30 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <9a719dd0430737a83ec106b509069a1c89bf407c@i2pn2.org> References: <vg7cp8$9jka$1@dont-email.me> <33512b63716ac263c16b7d64cd1d77578c8aea9d@i2pn2.org> <vj9s4i$11a3p$1@dont-email.me> <vjam6d$1700v$1@dont-email.me> <vjc65g$1i9vk$3@dont-email.me> <vjf7kl$2s7e5$1@dont-email.me> <vjfmq3$2upa9$3@dont-email.me> <c6b624cb0b1b55d54aab969ee5b4e283ec7be3cd@i2pn2.org> <vjhp8b$3gjbv$1@dont-email.me> <dc9e7638be92c4d158f238f8c042c8559cd46521@i2pn2.org> <vjjg6p$3tvsg$1@dont-email.me> <c31edc62508876748c8cf69f93ab80c0a7fd84ac@i2pn2.org> <vjka3b$1tms$3@dont-email.me> <e11a34c507a23732d83e3d0fcde7b609cdaf3ade@i2pn2.org> <vjmse3$k2go$2@dont-email.me> <069069bf23698c157ddfd9b62b9b2f632b484c40@i2pn2.org> <vjooeq$11n0g$2@dont-email.me> <2d3620a6e2a8a57d9db7a33c9d476fe03cac455b@i2pn2.org> <vjrfcc$1m1b2$1@dont-email.me> <75921cc1f17cdb691969a99e666f237cd09c0b09@i2pn2.org> <vjsrp1$1tqvv$2@dont-email.me> <25729298b142c60d5b245231984119d42d4ac089@i2pn2.org> <vko14j$53b6$3@dont-email.me> <vko1vp$5mmo$1@dont-email.me> <vkovk1$b7ki$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Sat, 28 Dec 2024 15:44:30 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="832983"; 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 Bytes: 2608 Lines: 17 Am Sat, 28 Dec 2024 14:48:50 +0100 schrieb WM: > On 28.12.2024 06:23, Moebius wrote: >>>> On 12/17/24 4:51 PM, WM wrote: >> >>>>> all FISONs contain/are all n. >> Hint: For each and every n e IN there is a FISON such that n is in it. > No. If so, then the union of all FISONs would contain all n. That is the case. > But fact is > that the union of all FISONs is a FISON (all FISONs have infinitely many > successors) and leaves almost all numbers outside ∀n ∈ ℕ_def: |ℕ \ {1, > 2, 3, ..., n}| = ℵo. No. There are infinitely many, so the union must be infinite too. -- 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.