| Deutsch English Français Italiano |
|
<8a2aedd8383a84ceef2fd985ac0bf529e2a0eccf@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 Date: Sat, 23 Nov 2024 21:22:17 -0500 Organization: i2pn2 (i2pn.org) Message-ID: <8a2aedd8383a84ceef2fd985ac0bf529e2a0eccf@i2pn2.org> References: <vg7cp8$9jka$1@dont-email.me> <vhfso7$1bik6$1@dont-email.me> <vhg0h8$1adlc$4@dont-email.me> <vhgd9j$1eq8t$1@dont-email.me> <vhgebm$1eu67$2@dont-email.me> <vhgfo7$1f8j9$1@dont-email.me> <vhiak4$1sjsn$2@dont-email.me> <094dadad718eaa3827ad225d54aaa45b880dd821@i2pn2.org> <vhkir2$28qt$2@dont-email.me> <3399a95e386bc5864f1cfcfc9f91f48366e0fed2@i2pn2.org> <vhlamn$7jan$3@dont-email.me> <0d551828411c0588000796fa107a16b1e23a866c@i2pn2.org> <vhprpj$15kfd$2@dont-email.me> <74bdc0f14fd0f2c6bfd9ac511a37f66b41948ac4@i2pn2.org> <vhq5ov$1793m$2@dont-email.me> <b82423aaf8df2203171c1eb1afcb913925875795@i2pn2.org> <vhqrsu$1bb1f$2@dont-email.me> <vhqu9n$1bqev$1@dont-email.me> <vhs9v9$1krl6$3@dont-email.me> <vhshas$1n123$1@dont-email.me> <vhsi31$1n2ck$1@dont-email.me> <vhsi7e$1n4sl$1@dont-email.me> <vhsit2$1n52r$1@dont-email.me> <vht7o6$1qo7j$1@dont-email.me> <vhtb3o$1r2tr$1@dont-email.me> <0d6d06a888e15ed2042aca8ec7e6ebb93590b7bc@i2pn2.org> <vhtgec$1rdku$3@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Sun, 24 Nov 2024 02:22:17 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="3856731"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird Content-Language: en-US X-Spam-Checker-Version: SpamAssassin 4.0.0 In-Reply-To: <vhtgec$1rdku$3@dont-email.me> Bytes: 5073 Lines: 97 On 11/23/24 4:11 PM, WM wrote: > On 23.11.2024 21:46, Richard Damon wrote: >> On 11/23/24 2:40 PM, WM wrote: >>> On 23.11.2024 19:43, FromTheRafters wrote: >>>> WM wrote on 11/23/2024 : >>>>> On 23.11.2024 13:35, FromTheRafters wrote: >>>>>> WM has brought this to us : >>>>>>> On 23.11.2024 13:20, FromTheRafters wrote: >>>>>>>> WM laid this down on his screen : >>>>>>> >>>>>>>>> Let every unit interval after a natural number on the real axis >>>>>>>>> be coloured white with exception of the intervals after the >>>>>>>>> prime numbers which are coloured red. It is impossible to shift >>>>>>>>> the red intervals so that the whole real axis becomes red. >>>>>>>>> Every interval (10n, 10 (n+1)] is deficient - on the whole real >>>>>>>>> axis. >>>>>>>> >>>>>>>> So what? Your imaginings don't affect the fact that there is a >>>>>>>> bijection. >>>>>>> >>>>>>> If there was a bijection, >>>>>> >>>>>> There is. >>>>>> >>>>>>> then the whole axis could become red. >>>>>> >>>>>> What makes you think that? >>>>> >>>>> A bijection proves that every prime number (and its colour) can be >>>>> put to a natural number (and colour it). >>>> >>>> ??? >>> >>> A bijection between natural numbers and prime numbers proves that for >>> every prime number there is a natural number: p_1, p_2, p_3, ... >>> If that is correct, then there are as many natural numbers as prime >>> numbers and as many prime numbers as natural numbers. Then the >>> following scenario is possible: >>> >>> Cover the unit intervals of prime numbers by red hats. Then shift the >>> red hats so that all unit intervals of the positive real axis get red >>> hats. >>> >>> Regards, WM >>> >> >> And you can, as >> the red hat on the number 2, can be moved to the number 1 >> the red hat on the number 3, can be moved to the number 2 >> the red hat on the number 5, can be moved to the number 3 > > A very naive recipe. But it works. >> >> and in general, the red hat on the nth prime number can be moved to >> the number n >> >> Since there are a countable infinite number of prime numbers, there >> exist an nth prime number for every n, > > Yes, for every n that belongs to a tiny initial segment. No, for EVERY n. Show one that it doesn't work for! > >> so all the numbers get covered. > > No. WHich one doesn't. Your LYING claims just prove your ignorance. >> >> We have a 1:1 relationship (bijection) established between the set of >> prime numbers and the set of Natural Numbers. > > No. Every hat taken from wherever leaves there a naked unit interval. > Therefore for every interval (0, n] inside which hats are moved, the > relative covering is about n/logn. Yes, it leave a naked unit interval, that will later be replaced by the n-th prime. Your problem is you apparently you can only think about finite sets, so you brain just explodes when you try to handle a truely infinite one. Infinity isn't just a redeculously big number, it is a different class of numbers, something your "finite number" logic just doesn't handle. > > Regards, WM