| Deutsch English Français Italiano |
|
<50220be0d285ad5de75ca434c9ed9cbd22fa037a@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: joes <noreply@example.org> Newsgroups: sci.math Subject: Re: How many different unit fractions are lessorequal than all unit fractions? Date: Wed, 9 Oct 2024 12:38:14 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <50220be0d285ad5de75ca434c9ed9cbd22fa037a@i2pn2.org> References: <vb4rde$22fb4$2@solani.org> <vd6v0d$qj9u$2@dont-email.me> <78a0f795-f1c0-4ba5-90f9-acf667968011@att.net> <vdef52$29746$3@dont-email.me> <aec625a9-581f-4692-b20f-831b9f121e52@att.net> <vdes49$2bj6r$2@dont-email.me> <adea0828-b2b1-4273-8e99-8c143f17f4f1@att.net> <vdhbhg$2qovr$1@dont-email.me> <fd9f0e31-89f5-46db-b1d9-f6f818901b2c@att.net> <vdj9rn$3713m$2@dont-email.me> <67e26dda-ec44-4927-82ac-dfc17dc3d07d@att.net> <vdmni6$3r0us$1@dont-email.me> <f2fd1874cd1db3afdce65e1fab820d103a648403@i2pn2.org> <vdodvf$5sti$5@dont-email.me> <53e48f71-1b93-4f2e-a21a-68a40b6ccefd@att.net> <vdpi26$bht3$1@dont-email.me> <0fe7418c059c5ae4c456927eed937f9df34bb7b4@i2pn2.org> <vdqud3$mnhe$1@dont-email.me> <vdr1om$n62q$3@dont-email.me> <74c23586-bae5-4ae7-a772-1eef6d50baa8@att.net> <vds4a1$s0e9$1@dont-email.me> <1a925120-7637-4eac-87bf-749f1befe54f@att.net> <ve30u8$24i4i$6@dont-email.me> <f1ba56d2-82cc-4e55-b90f-3e55d42b3e96@att.net> <ve5dr8$2j41n$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Wed, 9 Oct 2024 12:38:14 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="1251465"; 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: 3499 Lines: 41 Am Wed, 09 Oct 2024 10:11:20 +0200 schrieb WM: > On 08.10.2024 19:28, Jim Burns wrote: >> On 10/8/2024 6:18 AM, WM wrote: > >>> All infinite endsegments contain more than any finite set of numbers. >> ...still true if 'infinite' means "very large". > No. Very large is not more than any finite set. >> An end segment E is infinite because each natural number has a >> successor, >> so no element of E is max.E so not all nonempty subsets are two.ended >> so E is not finite. > Therefore every infinite endsegment has infinitely many elements with > each predecessor in common. This is valid for all infinite endsegments. With each, but not with all at once (cf. quantifier shift). >> There are no other end segments, none are finite. > They all have an infinite intersection. Intersection with what? >> Consider end segment E(k+1) >> k+1 is in E(k+1) >> Is k+1 in each end segment? Is k+1 in E(k+2)? >> Is E(k+1) the set of natural numbers in each end.segment? > No, but by definition there are infinitely many numbers. They are dark. >>> Why else should they be infinite? >> Because each natural number is followed by a natural number, > not only one but infinitely many >> because 'infinite' DOES NOT mean 'very large'. > Theorem: If every endsegment has infinitely many numbers, then > infinitely many numbers are in all endsegments. Invalid quantifier shift. > Proof: If not, then there would be at least one endsegment with less > numbers. No. Why do you think that? -- 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.