Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #520016 > unrolled thread
| Started by | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| First post | 2021-05-04 12:12 -0700 |
| Last post | 2021-05-08 00:04 -0700 |
| Articles | 20 on this page of 210 — 11 participants |
Back to article view | Back to sci.math
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-04 12:12 -0700
Re: Can a dark number be an even prime? Sergio <invalid@invalid.com> - 2021-05-04 15:57 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-05 15:14 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-05 13:57 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-05 20:06 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-06 10:18 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-06 13:31 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-06 11:08 -0700
Re: Can a dark number be an even prime? Sergio <invalid@invalid.com> - 2021-05-06 14:22 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-06 17:21 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-07 04:52 -0700
Re: Can a dark number be an even prime? Sergio <invalid@invalid.com> - 2021-05-07 11:44 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-07 17:30 -0400
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-08 20:13 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-09 06:10 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-09 14:44 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-09 12:28 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-09 19:58 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-10 05:23 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-10 13:39 -0400
Re: Can a dark number be an even prime? "mitchr...@gmail.com" <mitchrae3323@gmail.com> - 2021-05-10 11:33 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-10 16:23 -0400
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-10 17:24 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-10 11:39 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-10 16:42 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-11 06:07 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-12 00:13 -0400
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-12 00:22 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-12 05:51 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-12 13:33 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-12 17:41 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-13 04:54 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-13 13:14 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-14 05:23 -0700
Re: Can a dark number be an even prime? Sergio <invalid@invalid.com> - 2021-05-14 07:52 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-14 16:41 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-14 14:06 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-15 00:18 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-15 04:45 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-15 15:47 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-16 13:32 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-16 20:10 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-17 08:22 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-17 20:14 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-18 12:31 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-18 19:42 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-19 07:21 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-19 15:25 -0400
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-20 11:09 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-20 08:22 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-20 13:20 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-20 16:56 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-21 07:54 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-21 13:26 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-21 13:59 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-21 17:21 -0400
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-21 19:42 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-21 20:09 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-22 03:43 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-23 13:54 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-23 14:14 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-23 18:04 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-24 12:48 -0700
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-24 15:27 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-31 13:39 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-24 18:57 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-31 13:42 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-31 13:46 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-06-02 08:34 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-25 05:27 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-25 13:56 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-25 12:36 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-25 16:52 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-26 11:52 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-26 14:57 -0400
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-26 15:42 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-27 15:06 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-27 14:03 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-27 18:55 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 04:01 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-28 07:34 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 07:33 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-28 11:03 -0400
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 09:20 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-28 14:02 -0400
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 12:16 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 09:12 -0700
Re: Can a dark number be an even prime? William <wpihughes@gmail.com> - 2021-05-28 05:16 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 07:36 -0700
Re: Can a dark number be an even prime? William <wpihughes@gmail.com> - 2021-05-28 08:35 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 12:04 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 12:47 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 13:15 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 15:10 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-29 21:10 -0500
Re: Can a dark number be an even prime? William <wpihughes@gmail.com> - 2021-05-29 11:53 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-29 13:59 -0700
Re: Can a dark number be an even prime? William <wpihughes@gmail.com> - 2021-05-29 17:37 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-30 13:52 -0700
Re: Can a dark number be an even prime? William <wpihughes@gmail.com> - 2021-05-31 20:59 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-06-01 06:14 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-29 21:18 -0500
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 09:15 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 09:26 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 11:39 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 11:54 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-28 07:16 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 04:33 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-28 07:18 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-28 16:24 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 13:37 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-28 20:21 -0400
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 17:35 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-29 05:00 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-29 13:50 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-29 22:03 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-30 13:58 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-30 17:04 -0400
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-30 18:42 -0400
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-29 21:52 -0500
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-30 17:07 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-31 05:40 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-31 06:26 -0700
Re: Can a dark number be an even prime? Gus Gassmann <horand.gassmann@gmail.com> - 2021-05-31 07:46 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-06-03 12:52 -0500
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-31 08:09 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-06-02 08:33 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-29 13:37 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-29 08:26 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-29 14:08 -0400
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-29 21:20 -0500
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 15:59 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-27 21:48 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-25 14:39 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-25 12:45 -0700
Re: Can a dark number be an even prime? Gus Gassmann <horand.gassmann@gmail.com> - 2021-05-25 15:07 -0700
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-26 08:57 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-25 15:12 -0400
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-23 18:06 -0400
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-23 19:39 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-24 12:54 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-24 17:41 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-25 05:22 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-25 13:35 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-25 12:34 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-25 16:16 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-25 13:41 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-26 09:38 -0400
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-26 09:10 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-26 11:57 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-26 11:41 -0700
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-26 16:25 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-27 06:25 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-26 12:02 -0700
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-26 15:44 -0500
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-26 17:51 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-27 06:07 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-27 06:59 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-27 13:47 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-27 15:50 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-27 14:04 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-27 14:25 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-27 14:29 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-26 17:39 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-27 06:38 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-27 07:10 -0700
Re: Can a dark number be an even prime? FromTheRafters <erratic@nomail.afraid.org> - 2021-05-27 11:05 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-27 13:53 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-27 14:43 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-28 07:20 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-28 00:25 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 03:33 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-28 07:24 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 07:28 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-28 09:47 -0500
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 09:07 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 11:42 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 11:58 -0700
Re: Can a dark number be an even prime? Greg Cunt <franz.fritschee.ff@gmail.com> - 2021-05-28 12:04 -0700
Re: Can a dark number be an even prime? Sergio <imvalid@invalid.com> - 2021-05-29 23:01 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-28 15:00 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-28 12:24 -0700
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-26 09:05 -0500
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-26 09:00 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-20 14:55 -0400
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-20 07:26 -0700
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-20 12:45 -0500
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-20 12:44 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-18 05:08 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-18 12:44 -0700
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-20 12:37 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-20 13:16 -0700
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-21 12:47 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-18 11:17 -0400
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-18 12:56 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-18 12:35 -0700
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-20 12:44 -0500
Re: Can a dark number be an even prime? Meritocracy <invalod@invalid.com> - 2021-05-18 12:52 -0500
Re: Can a dark number be an even prime? Sergio <invalid@invalid.com> - 2021-05-15 15:57 -0500
Re: Can a dark number be an even prime? Jim Burns <james.g.burns@att.net> - 2021-05-12 13:25 -0400
Re: Can a dark number be an even prime? Sergio <invalid@invalid.com> - 2021-05-10 19:13 -0500
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-11 06:09 -0700
Re: Can a dark number be an even prime? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-05-10 21:31 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-11 06:18 -0700
Re: Can a dark number be an even prime? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-05-11 21:46 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-12 05:20 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-08 05:39 -0700
Re: Can a dark number be an even prime? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-05-05 22:18 -0700
Re: Can a dark number be an even prime? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-05-06 10:11 -0700
Re: Can a dark number be an even prime? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-05-08 00:04 -0700
Page 2 of 11 — ← Prev page 1 [2] 3 4 … 11 Next page →
| From | "mitchr...@gmail.com" <mitchrae3323@gmail.com> |
|---|---|
| Date | 2021-05-10 11:33 -0700 |
| Message-ID | <79417231-eb32-406a-962f-c85144ae8bc4n@googlegroups.com> |
| In reply to | #520644 |
On Monday, May 10, 2021 at 10:39:29 AM UTC-7, Jim Burns wrote:
> On 5/10/2021 8:23 AM, WM wrote:
> > Jim Burns schrieb
> > am Montag, 10. Mai 2021 um 01:58:55 UTC+2:
> >> On 5/9/2021 3:28 PM, WM wrote:
>
> >> k is in end segment E(j) iff
> >> a completable linearly-ordered crowd j,...,k exists
> >> such that, for all adjacent h,i, i = (h,b)
> >> The intersection of all end segments as described here
> >> is empty.
> >>
> >> Is the crowd E(j) complete? Is it potential?
> >
> > It is a potentially infinite set
> E(j) is a crowd.
>
> We know at least one thing about about what is in E(j)
> and what is not in E(j), the one thing I state above.
> From that one thing, we can reason without exception
> about the things in E(j).
>
> None of the elements in E(j) are last in E(j).
> Nonetheless, we can reason about them without exception.
>
> I'm not sure, but I think that forms the basis of your
> objection to "set theory". Your claim is that "set theory"
> cannot reason without exception unless a last element exists,
> and that claims otherwise are matheology and contradictions.
>
> Consider the possibility that "set theorists" are using
> reasoning that, like my reasoning, gives further statements
> true without exception, even if no last element exists.
> Consider the possibility that the reasoning that you _think_
> they are using is _not_ what they are using.
> > It is a potentially infinite set without some first elements.
> E(j) has a first element. It is j.
> > We can call it endsegment but it has a different meaning than
> > the usual endsegments of set theory.
> That is where we disagree. Everything I've done with the very
> weak theory of crowds can be repeated with any slightly
> competent set theory.
>
> E(j) is a crowd, not a set.
> E(j) does not have dark numbers.
>
> We have many set theories in which a set E'(j') exists
> containing exactly what is in E(j).
> It is reasonable to say that E'(j') has the same meaning
> as E(j). And reasonable to say that E'(j') does not contain
> dark numbers.
> > You should not call your crowd completable
> I call E(j) _not completable_ just a bit later in my post.
> > You should not call your crowd completable because it will
> > never have more than any finite number of elements.
> The reason I call E(j) not completable is how I define
> completable. It's false that all of the non-empty sub-crowds
> of E(j) contain both a first and a last.
>
> The problem with how you're using "finite" there is that
> you're just kicking down the road the answering of what it
> means to be finite. Or completable. Or ...
> You're just trading one term for another, with no explanation.
> >> Each N\{ 1,2,3,...,n } contains infinitely-many
> >> definable numbers. Yes.
> >
> > It is a potentially infinite endsegment of
> > the potentially infinite collection N.
Your collection will stay finite. The infinite potential
cannot be made.
As you have no way to put infinite elements into
any set. That is what cannot be stored or built...
Mitchell Raemsch
> Consider the possibility that
> what you called "complete" infinite collections that gave you
> unfamiliar and counter-intuitive results
> are the same collections as
> what you later call "potential" infinite collections, _after_
> you have examined the matter and understand where those
> _previously_ unfamiliar and counter-intuitive results
> come from.
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2021-05-10 16:23 -0400 |
| Message-ID | <s7c4nv$cng$1@dont-email.me> |
| In reply to | #520653 |
on 5/10/2021, mitchr...@gmail.com supposed :
> On Monday, May 10, 2021 at 10:39:29 AM UTC-7, Jim Burns wrote:
>> On 5/10/2021 8:23 AM, WM wrote:
>>> Jim Burns schrieb
>>> am Montag, 10. Mai 2021 um 01:58:55 UTC+2:
>>>> On 5/9/2021 3:28 PM, WM wrote:
>>
>>>> k is in end segment E(j) iff
>>>> a completable linearly-ordered crowd j,...,k exists
>>>> such that, for all adjacent h,i, i = (h,b)
>>>> The intersection of all end segments as described here
>>>> is empty.
>>>>
>>>> Is the crowd E(j) complete? Is it potential?
>>>
>>> It is a potentially infinite set
>> E(j) is a crowd.
>>
>> We know at least one thing about about what is in E(j)
>> and what is not in E(j), the one thing I state above.
>> From that one thing, we can reason without exception
>> about the things in E(j).
>>
>> None of the elements in E(j) are last in E(j).
>> Nonetheless, we can reason about them without exception.
>>
>> I'm not sure, but I think that forms the basis of your
>> objection to "set theory". Your claim is that "set theory"
>> cannot reason without exception unless a last element exists,
>> and that claims otherwise are matheology and contradictions.
>>
>> Consider the possibility that "set theorists" are using
>> reasoning that, like my reasoning, gives further statements
>> true without exception, even if no last element exists.
>> Consider the possibility that the reasoning that you _think_
>> they are using is _not_ what they are using.
>>> It is a potentially infinite set without some first elements. E(j) has a
>>> first element. It is j. We can call it endsegment but it has a different
>>> meaning than the usual endsegments of set theory.
>> That is where we disagree. Everything I've done with the very
>> weak theory of crowds can be repeated with any slightly
>> competent set theory.
>>
>> E(j) is a crowd, not a set.
>> E(j) does not have dark numbers.
>>
>> We have many set theories in which a set E'(j') exists
>> containing exactly what is in E(j).
>> It is reasonable to say that E'(j') has the same meaning
>> as E(j). And reasonable to say that E'(j') does not contain
>> dark numbers.
>>> You should not call your crowd completable I call E(j) _not completable_
>>> just a bit later in my post. You should not call your crowd completable
>>> because it will never have more than any finite number of elements.
>> The reason I call E(j) not completable is how I define
>> completable. It's false that all of the non-empty sub-crowds
>> of E(j) contain both a first and a last.
>>
>> The problem with how you're using "finite" there is that
>> you're just kicking down the road the answering of what it
>> means to be finite. Or completable. Or ...
>> You're just trading one term for another, with no explanation.
>>>> Each N\{ 1,2,3,...,n } contains infinitely-many
>>>> definable numbers. Yes.
>>>
>>> It is a potentially infinite endsegment of
>>> the potentially infinite collection N.
>
> Your collection will stay finite. The infinite potential
> cannot be made.
>
> As you have no way to put infinite elements into
> any set. That is what cannot be stored or built...
Then use bracket notation -- nothing to be stored or built.
{natural numbers with more than four base ten digits}
It's a tight fit, but there it is, an inductive subset. It's a bit
small though. ;)
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-10 17:24 -0400 |
| Message-ID | <02cc02bf-9793-7d38-d484-d15f04227870@att.net> |
| In reply to | #520653 |
On 5/10/2021 2:33 PM, mitchr...@gmail.com wrote:
> On Monday, May 10, 2021 at 10:39:29 AM UTC-7,
> Jim Burns wrote:
>> E(j) is a crowd.
>>
>> We know at least one thing about about what is in E(j)
>> and what is not in E(j), the one thing I state above.
>> From that one thing, we can reason without exception
>> about the things in E(j).
>>
>> None of the elements in E(j) are last in E(j).
>> Nonetheless, we can reason about them without exception.
>>>> Each N\{ 1,2,3,...,n } contains infinitely-many
>>>> definable numbers. Yes.
>>>
>>> It is a potentially infinite endsegment of
>>> the potentially infinite collection N.
>
> Your collection will stay finite. The infinite potential
> cannot be made.
>
> As you have no way to put infinite elements into
> any set. That is what cannot be stored or built...
Then I will continue not putting elements in or storing or
building. Instead of any of that, I will continue
reasoning about, which is none of those.
Let E(j) be the end segment starting at j.
k in E(j) iff
a completable linearly-ordered crowd j,...,k exists
such that, for all adjacent h,i in j,...,k, i = h+1.
I haven't put anything anywhere or stored anything or
built anything. I have said something that's true of
infinitely-many things. But, as you can see, it did not
take me infinitely-long to say it.
We can reason from "a completable ...".
Suppose we only use truth-preserving inferences to arrive
at some further statement P(k).
Whatever k "a completable ..." is true of, P(k) will also
be true of. This is what "truth-preserving" means.
There are infinitely-many k for which "a completable ..."
is true. So, if we arrive at some P(k), there are
infinitely-many for which P(k) is true.
How we know this about P(k) is by reasoning about infinitely
many. But, see, we haven't put or stored or built.
Only reasoned.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-05-10 11:39 -0700 |
| Message-ID | <c2f9e96a-e136-4062-b0b9-97c60360a8a6n@googlegroups.com> |
| In reply to | #520644 |
Jim Burns schrieb am Montag, 10. Mai 2021 um 19:39:29 UTC+2: > On 5/10/2021 8:23 AM, WM wrote: > I'm not sure, but I think that forms the basis of your > objection to "set theory". Your claim is that "set theory" > cannot reason without exception unless a last element exists, > and that claims otherwise are matheology and contradictions. This is not my claim but obvious fact: If the existence of all is claimed, then all should be available as individual. This is not the case. Only the first n elements are available in your crowd as well as in set theory. Therefore either nothing else exists like in your crowd or the rest is dark. > > Consider the possibility that "set theorists" are using > reasoning that, like my reasoning, gives further statements > true without exception, even if no last element exists. True without exception is that all accessible elements belong to a finite set without upper bound. True without exception is that potential infinity is nothing but the continuou process of creating natnumbers. > Consider the possibility that the reasoning that you _think_ > they are using is _not_ what they are using. They are reasoning that all natnumbers can be mapped with all rational numbers. That would never be defensible in potential infinity. They are reasoning that real numbers can be defined by their complete digit sequences. That would never be defensible in potential infinity. > > It is a potentially infinite set without some first elements. > E(j) has a first element. It is j. But the elements 1 to j - 1 are missing. > > We can call it endsegment but it has a different meaning than > > the usual endsegments of set theory. > That is where we disagree. Everything I've done with the very > weak theory of crowds can be repeated with any slightly > competent set theory. In set theory there are actually infinite sets. Remember counting to omega and beyond. More than any finite set of elements. That differes from crowds. Try only to solve one problem: When would your crowd have supplied enough indices to fix a real number by its digits? Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-10 16:42 -0400 |
| Message-ID | <c8b396e1-97aa-b5d1-2344-a046144f574a@att.net> |
| In reply to | #520655 |
On 5/10/2021 2:39 PM, WM wrote:
> Jim Burns schrieb
> am Montag, 10. Mai 2021 um 19:39:29 UTC+2:
>> On 5/10/2021 8:23 AM, WM wrote:
>> I'm not sure, but I think that forms the basis of your
>> objection to "set theory". Your claim is that "set theory"
>> cannot reason without exception unless a last element exists,
>> and that claims otherwise are matheology and contradictions.
>
> This is not my claim but obvious fact:
:)
> If the existence of all is claimed,
> then all should be available as individual.
If the claim is that all countable-to are countable-to,
then all countable-to should be countable-to.
I think you agree that we've met _this_ burden.
> This is not the case.
Maybe, maybe not. It is not agreed, we can say.
Let's start from _agreed-upon_ statements. Such as
that all countable-to are countable-to.
And then, we can advance our agreement to other claims
_about the countable-to_
If there are others which are not countable-to,
we are not justified by an argument _about the countable-to_
to make the same claims _about the not countable-to_
> Only the first n elements are available in your crowd
> as well as in set theory. Therefore either nothing else
> exists like in your crowd or the rest is dark.
I listed (at least some of) what exists at the start.
_Individual_ b exists.
_Ordered pair_ (x,y) exists if x and y exist.
_Crowd_ pp exists such that for all x, x in pp iff P(x),
for a predicate P(x) on individual-or-ordered-pair x.
There is a lot for which existence follows from what's
listed there. All the naturals. All the end segments.
All of what's in each end segment.
>> Consider the possibility that "set theorists" are using
>> reasoning that, like my reasoning, gives further statements
>> true without exception, even if no last element exists.
>
> True without exception is that all accessible elements
> belong to a finite set without upper bound.
Then you've changed what you mean by "finite" from yesterday,
when I answered your question about infinitely-many
definables in N\{ 1,2,3,...,n }.
>> Each crowd is not completable.
>> Each crowd is reasonably called "infinite".
A non-empty linearly-ordered set without an upper bound
is not completable. It can reasonably be called not finite.
Both finite (completable) and without upper bound is
not a thing.
Thus, you're talking about something different now.
https://en.wikipedia.org/wiki/Equivocation
> True without exception is that potential infinity is
> nothing but the continuou process of creating natnumbers.
I still offer no opinion on potential or complete.
I'll just carry on reasoning about all of whatever we've
described, whichever way you decide.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-05-11 06:07 -0700 |
| Message-ID | <43dbd4b8-6ba8-41ee-8c69-25837b0275fdn@googlegroups.com> |
| In reply to | #520678 |
Jim Burns schrieb am Montag, 10. Mai 2021 um 22:42:42 UTC+2: > On 5/10/2021 2:39 PM, WM wrote: > > True without exception is that potential infinity is > > nothing but the continuou process of creating natnumbers. > I still offer no opinion on potential or complete. > Try only to solve one problem: When would your crowd have supplied enough indices to fix a real number by its digits? Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-12 00:13 -0400 |
| Message-ID | <092d39dd-186c-9ebf-f62f-c7aa69b3f119@att.net> |
| In reply to | #520759 |
On 5/11/2021 9:07 AM, WM wrote: > Jim Burns schrieb > am Montag, 10. Mai 2021 um 22:42:42 UTC+2: >> On 5/10/2021 2:39 PM, WM wrote: >>> True without exception is that potential infinity is >>> nothing but the continuou process of creating natnumbers. >> >> I still offer no opinion on potential or complete. > > Try only to solve one problem: > When would your crowd have supplied enough indices > to fix a real number by its digits? You may recall that I came to describing a natural number as countable-to and countable-beyond by way of asking "What is a natural number? What is its purpose?" ( It's possible that I copied the pattern of inquiry ( from Dedekind's _Was sind und was sollen die Zahlen_ ( I didn't intend to copy, but those are good questions. And then we were able to move on from that description, a thin but uncontroversial one, to other more-disputed claims about natural numbers. Because we only move on by truth- -preserving inferences, any further claim we can move to (i) is about natural numbers without exception and (ii) should be no more disputed than "countable-to and countable-beyond". Your question here is about the real numbers, not only the natural numbers. I intend to keep the pattern of argument that I have been using to address infinitely-many -- True things about one of infinitely many -- Truth-preserving inferences -- More true things about the same infinitely many However, here the infinitely-many will be real numbers in some instances. We need to ask again "What is it? What is its purpose?" but this time we're asking about the real numbers. ---- I claim that | Real numbers are intended to describe points on | a geometric line. | Answers to "What is a geometric line like?" will justify | some of the answers to "What are real numbers like?" | Points in a real line are encompassed (in a rare literal sense) | by the (defined to be) unit-segment, which has ends labeled "0" | and "1", and by _countable-to_ extensions of the unit-segment | in both directions, to points labeled "2","3",... and | "-1","-2",... The limitation that the number of unit-length extensions be countable-to (that is, finitely-many) can be called the Archimedean property. Or an application of Ockham's razor. Given a unit length 1, there is a classical geometric _reciprocal_ operation to find y = 1/x. One constructs similar right triangles with corresponding sides y:1:(don't care) and 1:x:(don't care). Thus, y = 1/x. ---- > When would your crowd have supplied enough indices > to fix a real number by its digits? There is no point on the line beyond all countable-to unit-length extension. This is a matter of what we mean by a point on the line. The reciprocal operation pairs points x,y such that y = 1/x. There is no point on (0, 1] below all unit fractions 1/n. If there were such a dark point x, it would have a reciprocal 1/x above all n. That would be a point in something else, something other than the geometric line the real numbers are intended to describe. ---- How will we describe the digits that fix a real number? A crowd of pairs (n, d[n]) where n is the digit's place, its power of ten, and d[n] is the digit's value, 0,1,...,9 The crowd of (place,digit) pairs determines two crowds A,B of finite decimals such that everything in A is above everything in B for each unit fraction 1/n, there are finite decimals in A and in B closer than 1/n. Lemma. There is at most one point above everything in B and below everything in A. Suppose there were two such points r,s. Because of the Archimedean property, there must be some n such that abs(r - s) > 1/n However, there is a point x in B and y in A such that abs(x -y) < 1/n We can't have x < r < y and x < s < y Contradiction. Therefore, there is at most one point above everything in B and below everything in A. ---- Therefore, _all_ the decimal digits determine _at most_ one point in the line. That doesn't show that _all_ the decimal digits determine _at most_ one point in the line. You didn't ask that, and this has already been on the long-ish side. "At least one point" is a discussion for another day. We can show it from the assumption that, if two continuous curves cross, then they must intersect.
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-12 00:22 -0400 |
| Message-ID | <53c4ea9a-ca82-275e-6a12-a6c2c55e433e@att.net> |
| In reply to | #520814 |
On 5/12/2021 12:13 AM, Jim Burns wrote: > Therefore, _all_ the decimal digits determine _at most_ > one point in the line. > > That doesn't show that _all_ the decimal digits determine > _at most_ one point in the line. You didn't ask that, > and this has already been on the long-ish side. I meant "at least" here. Sorry. And now, it's a bit longer. Good night. > > "At least one point" is a discussion for another day. > We can show it from the assumption that, > if two continuous curves cross, then they must intersect. > >
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-05-12 05:51 -0700 |
| Message-ID | <7c71c056-a1c0-465f-b861-9c704c07e5c8n@googlegroups.com> |
| In reply to | #520814 |
Jim Burns schrieb am Mittwoch, 12. Mai 2021 um 06:13:27 UTC+2: > On 5/11/2021 9:07 AM, WM wrote: > > When would your crowd have supplied enough indices > > to fix a real number by its digits? > You may recall that I came to describing a natural number > as countable-to and countable-beyond by way of asking > "What is a natural number? What is its purpose?" Let us first come to the answer of my question. > > I claim that > | Real numbers are intended to describe points on > | a geometric line. Let us first come to the answer of my question. > > When would your crowd have supplied enough indices > > to fix a real number by its digits? > There is no point on the line beyond all countable-to > unit-length extension. This is a matter of what we mean by > a point on the line. That was not my question. > > The reciprocal operation pairs points x,y such that y = 1/x. > There is no point on (0, 1] below all unit fractions 1/n. That was not my question. > How will we describe the digits that fix a real number? > A crowd of pairs (n, d[n]) where n is the digit's place, > its power of ten, and d[n] is the digit's value, 0,1,...,9 When would your crowd have supplied enough indices to fix a real number by its digits? > > Lemma. > There is at most one point above everything in B and > below everything in A. When would your crowd have supplied enough indices to fix A and B by its digits? > > Therefore, there is at most one point above everything in B > and below everything in A. When would your crowd have supplied enough indices to fix A and B by its digits? > > ---- > Therefore, _all_ the decimal digits determine _at most_ > one point in the line. How much is "all" of a crowd? Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-05-12 13:33 -0700 |
| Message-ID | <b1f6fcea-2852-4fc3-a99a-a137ba09a407n@googlegroups.com> |
| In reply to | #520838 |
Jim Burns schrieb am Mittwoch, 12. Mai 2021 um 19:25:39 UTC+2: > On 5/12/2021 8:51 AM, WM wrote: > > When would your crowd have supplied enough indices to > > fix A and B by its digits? > > > When would your crowd have supplied enough indices to > > fix A and B by its digits? > In summary, you want what you want when you want it in particular if it shortens your long articles. > More than the countable-to indices are not necessary. Wrong. Every countable-to index is a countable-beyond index. Therefore it is not sufficient to fix a real number. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-12 17:41 -0400 |
| Message-ID | <67e93519-ebd3-c5cf-92f0-aa39911c2fac@att.net> |
| In reply to | #520877 |
On 5/12/2021 4:33 PM, WM wrote: > Jim Burns schrieb > am Mittwoch, 12. Mai 2021 um 19:25:39 UTC+2: >> On 5/12/2021 8:51 AM, WM wrote: >>> When would your crowd have supplied enough indices to >>> fix A and B by its digits? >> >>> When would your crowd have supplied enough indices to >>> fix A and B by its digits? >> >> In summary, you want what you want when you want it > > in particular if it shortens your long articles. >> In summary, you want what you want when you want it >> the way you want it, which excludes those "reasons" >> slipped in with the answer. I can only imagine how proud your students and colleagues at Hochschule Augsburg are to associate with you, Wolfgang Mückenheim. >>>>> When would your crowd have supplied enough indices >>>>> to fix a real number by its digits? >> More than the countable-to indices are not necessary. > > Wrong. If, for all countable-to n, abs(x - y) < 1/n, then x = y. (Archimedes and/or Ockham) For two points x,y with the same countable-to indexed digits, for all countable-to n, abs(x - y) < 1/n. For two points x,y with the same countable-to indexed digits, x = y. Digits for _all_ the countable indices are unambiguous. > Every countable-to index is a countable-beyond index. > Therefore it is not sufficient to fix a real number. Every countable-to index is a countable-beyond index. Therefore it and its predecessors are not _all_ the indices. Digits for _all_ the countable indices are unambiguous.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-05-13 04:54 -0700 |
| Message-ID | <e24cdb15-25d8-4bb3-b611-c76fdc66e42cn@googlegroups.com> |
| In reply to | #520917 |
Jim Burns schrieb am Mittwoch, 12. Mai 2021 um 23:41:24 UTC+2: > On 5/12/2021 4:33 PM, WM wrote: > >> In summary, you want what you want when you want it > >> the way you want it, which excludes those "reasons" > >> slipped in with the answer. > I can only imagine how proud your students and colleagues > at Hochschule Augsburg are to associate with you, > Wolfgang Mückenheim. Can you? > >>>>> When would your crowd have supplied enough indices > >>>>> to fix a real number by its digits? > >> More than the countable-to indices are not necessary. > > > > Wrong. > If, for all countable-to n, abs(x - y) < 1/n, > then x = y. (Archimedes and/or Ockham) If. But "for all countable-to n" is not verifiable because every such n has more successors than predecessors. So the premise is false. > > For two points x,y with the same countable-to indexed digits, > for all countable-to n, abs(x - y) < 1/n. "The same countable-to indexed digits" is not verifiable without a finite formula. > > > Every countable-to index is a countable-beyond index. > > Therefore it is not sufficient to fix a real number. > > Every countable-to index is a countable-beyond index. > Therefore it and its predecessors are not _all_ the indices. Therefore they do not fix a real number. > > Digits for _all_ the countable indices are unambiguous. But not available. Example: All intervals [1/(n+1), 1/n] would exhaust the interval (0, 1]. But that is not possible because you cannot access them individually. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-13 13:14 -0400 |
| Message-ID | <a1b407c3-c027-b196-de84-981bdc2f9ba5@att.net> |
| In reply to | #520943 |
On 5/13/2021 7:54 AM, WM wrote: > Jim Burns schrieb > am Mittwoch, 12. Mai 2021 um 23:41:24 UTC+2: >> On 5/12/2021 4:33 PM, WM wrote: >>>>>>> When would your crowd have supplied enough indices >>>>>>> to fix a real number by its digits? >>>> >>>> More than the countable-to indices are not necessary. >>> >>> Wrong. >> >> If, for all countable-to n, abs(x - y) < 1/n, >> then x = y. (Archimedes and/or Ockham) > > If. > But "for all countable-to n" is not verifiable because > every such n has more successors than predecessors. Some statements are true for every such n. We start with those statements and proceed by truth-preserving inferences, step-by-step, to further statements. One such statement is "Countable-to n is countable-to". More statements can detail what we mean by "countable-to", by "completable", by "linearly-ordered", by "crowd", by "ordered pair", by "individual". Because our inferences are truth-preserving, the later statements, when understood to be about the same things as earlier statements, are as true as the earlier statements. The claims are verified -- by how we start, by how we advance. It's not the kind of verification you want. But, other than it not being the kind you _want_ you haven't found an objection. > So the premise is false. If you want verification, do this: -- State true things about one of infinitely-many -- Make truth-preserving inferences -- State more true things about the same infinitely-many >> For two points x,y with the same countable-to indexed digits, >> for all countable-to n, abs(x - y) < 1/n. > > "The same countable-to indexed digits" is not verifiable > without a finite formula. If you want verification, do this: -- State true things about one of infinitely-many -- Make truth-preserving inferences -- State more true things about the same infinitely-many >>> Every countable-to index is a countable-beyond index. >>> Therefore it is not sufficient to fix a real number. >> >> Every countable-to index is a countable-beyond index. >> Therefore it and its predecessors are not _all_ the indices. > > Therefore they do not fix a real number. > >> Digits for _all_ the countable indices are unambiguous. > > But not available. The individual b exists. For existing x,y, the ordered pair (x,y) exists. For a predicate P(x) on existing individual-or-ordered-pair x, the crowd pp for which, for all individual-or-ordered-pair x, x is in pp iff P(x), exists. You didn't object to these claims earlier. You think that you can accept very intuitive, very undisputed initial claims and also reject their consequences. Wrong. > Example: > All intervals [1/(n+1), 1/n] would exhaust the interval (0, 1]. > But that is not possible because you cannot access them > individually. -- State true things about one of infinitely-many individuals -- Make truth-preserving inferences -- State more true things about the same infinitely-many individuals
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-05-14 05:23 -0700 |
| Message-ID | <f4549dd4-a799-4464-bb16-c1b2e60cae40n@googlegroups.com> |
| In reply to | #520970 |
Jim Burns schrieb am Donnerstag, 13. Mai 2021 um 19:14:59 UTC+2: > On 5/13/2021 7:54 AM, WM wrote: > > Jim Burns schrieb > > am Mittwoch, 12. Mai 2021 um 23:41:24 UTC+2: > >> On 5/12/2021 4:33 PM, WM wrote: > > >>>>>>> When would your crowd have supplied enough indices > >>>>>>> to fix a real number by its digits? > >>>> > >>>> More than the countable-to indices are not necessary. > >>> > >>> Wrong. > >> > >> If, for all countable-to n, abs(x - y) < 1/n, > >> then x = y. (Archimedes and/or Ockham) > > > > If. > > But "for all countable-to n" is not verifiable because > > every such n has more successors than predecessors. > Some statements are true for every such n. The definition of a real number by a sequence of digits requires EITHER a formula which allows to calculate how the sequence goes on at every step OR all digits showing every step until the last step. In Cantor-lists we have no formulas. > You didn't object to these claims earlier. These claims cannot change the above fact. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2021-05-14 07:52 -0500 |
| Message-ID | <s7lrpv$peb$1@gioia.aioe.org> |
| In reply to | #521052 |
On 5/14/2021 7:23 AM, WM wrote: > Jim Burns schrieb am Donnerstag, 13. Mai 2021 um 19:14:59 UTC+2: >> On 5/13/2021 7:54 AM, WM wrote: >>> Jim Burns schrieb >>> am Mittwoch, 12. Mai 2021 um 23:41:24 UTC+2: >>>> On 5/12/2021 4:33 PM, WM wrote: >> >>>>>>>>> When would your crowd have supplied enough indices >>>>>>>>> to fix a real number by its digits? >>>>>> >>>>>> More than the countable-to indices are not necessary. >>>>> >>>>> Wrong. >>>> >>>> If, for all countable-to n, abs(x - y) < 1/n, >>>> then x = y. (Archimedes and/or Ockham) >>> >>> If. >>> But "for all countable-to n" is not verifiable because >>> every such n has more successors than predecessors. >> Some statements are true for every such n. > > The definition of a real number by a sequence of digits requires > EITHER a formula which allows to calculate how the sequence goes on at every step > OR all digits showing every step until the last step. > In Cantor-lists we have no formulas. wrong, Cantor uses fractions, which are formulas. > >> You didn't object to these claims earlier. > > These claims cannot change the above fact. above is conjecture, not fact > > Regards, WM >
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-14 16:41 -0400 |
| Message-ID | <2ce474a3-5caa-123e-2eb0-4f7897f29fe3@att.net> |
| In reply to | #521052 |
On 5/14/2021 8:23 AM, WM wrote: > Jim Burns schrieb > am Donnerstag, 13. Mai 2021 um 19:14:59 UTC+2: >> On 5/13/2021 7:54 AM, WM wrote: >>> Jim Burns schrieb >>> am Mittwoch, 12. Mai 2021 um 23:41:24 UTC+2: >>>> On 5/12/2021 4:33 PM, WM wrote: >>>>>>>>> When would your crowd have supplied enough indices >>>>>>>>> to fix a real number by its digits? >>>>>> >>>>>> More than the countable-to indices are not necessary. >>>>> >>>>> Wrong. >>>> >>>> If, for all countable-to n, abs(x - y) < 1/n, >>>> then x = y. (Archimedes and/or Ockham) >>> >>> If. >>> But "for all countable-to n" is not verifiable because >>> every such n has more successors than predecessors. >> >> Some statements are true for every such n. > > The *definition* of a real number by a sequence of digits The *determination* of a point by a sequence of digits requires that, for each sequence of digits, NO MORE than one point allowed by the sequence exists, and NO LESS than one point allowed by the sequence exists. By "point", I mean "point in the geometric line". Points in the geometric line are what real numbers are intended to represent. ---- | For each sequence of digits, | NO MORE than one point is allowed. An infinite sequence of digits disallows almost all of the geometric line. Consider 3.1415926535... What is disallowed? A point x is disallowed as too low if x =< 3. or x =< 3.0 or x =< 3.13 or x =< 3.140 or x =< 3.1414 or x =< 3.14158 or ... A point y is disallowed as too high if y >= 5. or y >= 3.3 or y >= 3.16 or y >= 3.143 or y >= 3.1417 or y >= 3.14161 or ... And so on, for countable-to digits. For every countable-to n, a corresponding too-low point x and too-high point y exist such that (y - x) < 1/n Suppose, in order to derive a contradiction, that TWO distinct points u,v are NOT disallowed. (For simplicity, let u < v.) u and v are distinct points in the geometric line. There is a completable reciprocal operation that gives us a point 1/(v-u) (The reciprocal uses similar right triangles.) The point 1/(v-u) must lie beyond all countable-to n. If it didn't lie beyond all, there would be some countable-to m > 1/(v-u). and, since there are too-low point x and too-high y such that (y-x) < m, at least one of u and v must be disallowed. But both u and v are not disallowed, by assumption. _What we mean_ by geometric line excludes points beyond all countable-to n. | The geometric line included the segment [0,1] and | countable-to extensions to points 2,3,4,... and | points -1,-2,-3,... We can refer to this as the Archimedean property or a result of Ockham's razor. Therefore, one consequence of including no more than countable-to extensions of the unit segment is that countable-to digits in the digit sequence allow NO MORE than one point. Therefore, for each sequence of digits, NO MORE than one point is allowed. ---- | For each sequence of digits, | NO LESS than one point is allowed. Given _what we mean_ by geometric line, there must be a point between all the points disallowed as too low and all all the points disallowed as too high. Again, consider 3.1415926535... A point x is disallowed as too low if x =< 3. or 3.0 or 3.13 or 3.140 or ... A point y is disallowed as too high if y >= 5. or 3.3 or 3.16 or 3.143 or ... Define a _continuous_ curve f(z) such that if z is disallowed as too low, f(z) = 0 if z is disallowed as too high, f(z) = 1 What if z is neither too low nor too high? Such a z would be point between all the too-low points and all the too high points. Suppose, in order to derive a contradiction, that there IS NO point z between all too-low points and all too-high points. Then f(z) is continuous at every point in the line. We can define another continuous curve g(z) = 1/2 And g(z) CROSSES f(z). HOWEVER, g(z) DOES NOT INTERSECT f(z). _What we mean_ by geometric line includes that | if two continuous curves cross, then they must intersect. But that contradicts no z being between all the too-low points and all the too-high points. Therefore, there is no less than one point between all the too-low points and all the too-high points. Therefore, for each sequence of digits, NO LESS than one point is allowed. > The definition of a real number by a sequence of digits > requires > EITHER a formula which allows to calculate how > the sequence goes on at every step > OR all digits showing every step until the last step. > In Cantor-lists we have no formulas. > >> You didn't object to these claims earlier. > > These claims cannot change the above fact. For each sequence of digits, NO MORE than one point is allowed. For each sequence of digits, NO LESS than one point is allowed. These follow from all points in the line are encompassed by countable-to unit extensions of the unit segment, and two continuous curves which cross must intersect. The general form of the argument is -- State true things about one of infinitely many -- Use truth-preserving inferences -- State more true things about the same infinitely many Here, the infinitely-many are infinitely-many points in the geometric line. Suppose you (WM) denied, for the geometric line, that there are only countable-to unit extensions, or that continuous curves that cross must intersect. You wouldn't have _contradicted_ my argument. You would have chosen to talk about something else, something other than a geometric line.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-05-14 14:06 -0700 |
| Message-ID | <2f7ac1d3-90cd-4bd4-adb3-2867a44afc75n@googlegroups.com> |
| In reply to | #521105 |
Jim Burns schrieb am Freitag, 14. Mai 2021 um 22:41:37 UTC+2: > On 5/14/2021 8:23 AM, WM wrote: > > The *definition* of a real number by a sequence of digits > > The *determination* of a point by a sequence of digits > requires that, for each sequence of digits, > NO MORE than one point allowed by the sequence exists, and > NO LESS than one point allowed by the sequence exists. Yes. > > By "point", I mean "point in the geometric line". > Points in the geometric line are what real numbers are > intended to represent. Yes. > > ---- > | For each sequence of digits, > | NO MORE than one point is allowed. > > An infinite sequence of digits disallows almost all of > the geometric line. > > Consider 3.1415926535... > What is disallowed? That sequence is trivial because it is defined by a formula, in fact even by many formulas. > > Again, consider 3.1415926535... Again, trivial. What we are interested in is an infinite sequence without a formula. > For each sequence of digits, > NO MORE than one point is allowed. > That requires a last digit, because if the last digit (or any digit) is not fixed, then we have at least 10 different points since the power is 10^-n but not 10^-ω. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-15 00:18 -0400 |
| Message-ID | <f12ac4b9-e0cc-e22b-ee5b-429a74e1bda5@att.net> |
| In reply to | #521109 |
On 5/14/2021 5:06 PM, WM wrote: > Jim Burns schrieb > am Freitag, 14. Mai 2021 um 22:41:37 UTC+2: >> On 5/14/2021 8:23 AM, WM wrote: >>> The *definition* of a real number by a sequence of digits >> >> The *determination* of a point by a sequence of digits >> requires that, for each sequence of digits, >> NO MORE than one point allowed by the sequence exists, and >> NO LESS than one point allowed by the sequence exists. > > Yes. >> >> By "point", I mean "point in the geometric line". >> Points in the geometric line are what real numbers are >> intended to represent. > > Yes. >> >> ---- >> | For each sequence of digits, >> | NO MORE than one point is allowed. >> >> An infinite sequence of digits disallows almost all of >> the geometric line. >> >> Consider 3.1415926535... >> What is disallowed? > > That sequence is trivial because it is defined by a formula, > in fact even by many formulas. The digit sequence 3.1415926535... is only an example, an aid for the intuition. The general form of the argument is -- State true things about one of infinitely many -- Use truth-preserving inferences -- State more true things about the same infinitely many Here, the infinitely-many are infinitely-many digit sequences. The first true statements will be what make this an argument about digit sequences (all the digit sequences) instead of, perhaps, natural numbers (all the natural numbers) or right triangles (all the right triangles). We will know these first true statements are true because we know what a digit sequence is. The first true statements will be true of 3.1415926535..., since 3.1415926535... is a digit sequence, but they will not be true of _only_ 3.1415926535..., rather of _any_ digit sequence. -- State true things about one of infinitely many -- Use truth-preserving inferences -- State more true things about the same infinitely many ---- Our common vocabulary, yours and mine, includes an existing individual b, an existing ordered pair (x,y) of existing x,y, an existing crowd pp with members determined by P(x) the crowd N of countable-to members of the sequence b, (b,b), ((b,b),b), (((b,b),b),b), ... For convenience, we can us the traditional labels for members of that sequence, 0,1,2,3,... From all this, we can describe something that does what we want a digit sequence to do. So, we say, this is a digit sequence, and we have our first true statements about a digit sequence. Each digit is one of 0,1,2,...,9 Each digit has a place, a power of 10. We can associate them with an ordered pair. A single example of a digit sequence 3.1415926535... is the crowd of pairs containing (3,0), (1,1), (4,2), (1,3), (5,4), (9,5), ... In general, a digit sequence is a crowd dd of pairs such that, for all k in N, there is one and only one (j,k) in dd, and, for all (j,k) in dd, j is one of 0,1,2,...,9. A crowd like that is a _digit sequence_ >> Again, consider 3.1415926535... > > Again, trivial. What we are interested in is > an infinite sequence without a formula. No, we are interested in _all_ digit sequences, with or without formulas. Certainly, all the formulas you are _interested in_ are included in _all_ -- State true things about one of infinitely many -- Use truth-preserving inferences -- State more true things about the same infinitely many We've got some things stated which are true no matter which digit sequence (crowd of pairs with a certain description) is referred to. We can reason from there. What we have to start with (a crowd of pairs with a certain description) is enough to get to -- for each sequence of digits, NO MORE than one point is allowed. -- for each sequence of digits, NO LESS than one point is allowed. You have no doubt noticed that the truths we start with do not include any actual values of digits, only that they are one of 0,1,2,...,9. We don't need to know any more, any actual values in order to reach those conclusions. The point I'm making, the REALLY BIG point, is that _this is how we can reason about infinitely-many_ We start with _only_ such statements as are true of _each_ of infinitely many, so that, when we advance to further statements by truth-preserving inferences, we know those further statements to be true of the _same_ infinitely-many. >> For each sequence of digits, >> NO MORE than one point is allowed. > > That requires a last digit, because if the last digit > (or any digit) is not fixed, then we have at least > 10 different points since the power is 10^-n > but not 10^-ω. There are no points in the line beyond all countable-to unit-length extensions (beyond all n). (Archimedes) Because, for each point x, there is a unique point y = 1/x (similar right triangles), there are no points in (0, 1] between all 1/n and 0. If any digit sequence allowed more than one point, there would need to be a point in (0, 1] between all 1/n and 0. Contradiction. Therefore, for each sequence of digits, NO MORE than one point is allowed.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-05-15 04:45 -0700 |
| Message-ID | <60acb70b-f887-49dd-993a-f52c2b07b9c7n@googlegroups.com> |
| In reply to | #521149 |
Jim Burns schrieb am Samstag, 15. Mai 2021 um 06:18:51 UTC+2: > On 5/14/2021 5:06 PM, WM wrote: > > That sequence is trivial because it is defined by a formula, > > in fact even by many formulas. > The digit sequence 3.1415926535... is only an example, > an aid for the intuition. Every sequence defined by a formula is unproblematic. But other sequences cannot be stated, written or read. > The general form of the argument is irrelevant for this case. Sequences without formula cannot be applied. > -- State true things about one of infinitely many Try to understand that infinite digit sequences without generating formula are nonsense. > > Therefore, > for each sequence of digits, > NO MORE than one point is allowed. Completely irrelevant. Try to define one point by an infinite digit sequence without generating formula. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-05-15 15:47 -0400 |
| Message-ID | <3fee69f5-b729-f8fa-74fa-17a7af41eb2a@att.net> |
| In reply to | #521169 |
On 5/15/2021 7:45 AM, WM wrote: > Jim Burns schrieb > am Samstag, 15. Mai 2021 um 06:18:51 UTC+2: >> On 5/14/2021 5:06 PM, WM wrote: >>> That sequence is trivial because it is defined by >>> a formula, in fact even by many formulas. >> >> The digit sequence 3.1415926535... is only an example, >> an aid for the intuition. > > Every sequence defined by a formula is unproblematic. > But other sequences cannot be stated, written or read. We can make some statements that are true of a digit sequence, that we know are true without know which digit sequence is referred to. | For a _digit sequence_ | for each countable-to index, there is a unique _digit_ | Each _digit_ is one of 0,1,2,...,9. Whether or not we include a claim such as ?? All the digits are determined by a formula. _these_ statements are true about a digit sequence. ( One could argue that we _shouldn't_ make the formula-claim ( (in part) because we would turn what were clear and ( uncontroversial claims into a time-wasting trip down the ( rabbit hole. However, whether we _should_ or we _shouldn't_ ( we _don't_ The claim I intend to support is that a _digit sequence_ determines a unique _point_ in the line. We should also make some clear and uncontroversial claims about a point in the line. | The line include the unit segment [0,1] and countable-to | unit-length extensions in both directions. And no more. | Two continuous curves which cross must intersect. A digit sequence partitions the line into three parts: points too low, points too high, points (if any) neither too low nor too high. If a digit sequence exists, this partition exists. No claim about a digit formula is used to show it exists. ---- For any countable-to n, there is a too-low point x and a too-high point y such that y - x < 1/n No claim about a digit formula is used to show they exist. Suppose, in order to show a contradiction, that there are TWO points u,v in the third, Goldilocks, not-too-low-not-too-high part. Then, for each countable-to n, v - u < 1/n If there is a point v - u between 0 and all 1/n, there is a point 1/(v - u) after all countable n ( We can show a geometric procedure to find 1/(v - u) ( using similar right triangles. This contradicts the clear and uncontroversial claim | The line include the unit segment [0,1] and countable-to | unit-length extensions in both directions. And no more. Contradiction. There is no point after all countable-to n. There is no point in (0, 1] before all 1/n. There are no TWO points not-too-low-not-too-high. Therefore, NO MORE than one point allowed by the sequence exists. ---- Suppose, in order to show a contradiction, that there are NO points u,v in the third, Goldilocks, not-too-low-not-too-high part. Then there are continuous curves which CROSS but do not INTERSECT. Define the function f(z) so that f(z) = 0 is z is too low f(z) = 1 if z is too high f(z) is continuous at every too-low point and too-high point, and, by assumption, those are _all the points_ Define another function g(z) = 1/2 g(z) is continuous at every point z. f(z) and g(z) cross. f(z) and g(z) do not intersect. This contradicts the clear and uncontroversial claim | Two continuous curves which cross must intersect. Therefore, there can't be NO points in the third, Goldilocks, not-too-low-not-too-high part of the line. Therefore, NO LESS than one point allowed by the sequence exists. ---- NO MORE than one point allowed by the sequence exists. NO LESS than one point allowed by the sequence exists. The digit sequence determines a unique point in the line. Saying the digits of a sequence are determined by a formula doesn't contradict any part of this argument. Saying the digits of a sequence are NOT determined by a formula doesn't contradict any part of this argument. >> The general form of the argument is > > irrelevant for this case. I make some clear and uncontroversial claims about digit sequences and points in the line. | Being a digit sequence means that, for each | countable-to index, there is a unique digit. | All the points in a line are included in | countable-to unit-length extensions. | Two continuous curves which cross must intersect. From those claims, it follows | A digit sequence determines a unique point in the line. > Sequences without formula cannot be applied. Whatever "applied" means to you, it must therefore be that being "applied" is not something a digit sequence needs in order to determine a unique point in the line. >> -- State true things about one of infinitely many > > Try to understand that infinite digit sequences without > generating formula are nonsense. It's not nonsense to say | Being a digit sequence means that, for each | countable-to index, there is a unique digit. It's not nonsense to say | All the points in a line are included in | countable-to unit-length extensions. It's not nonsense to say | Two continuous curves which cross must intersect. And, once we've made those claims, it must be that | A digit sequence determines a unique point in the line. If our intuition tells us that's nonsense, then we need better intuition.
[toc] | [prev] | [next] | [standalone]
Page 2 of 11 — ← Prev page 1 [2] 3 4 … 11 Next page →
Back to top | Article view | sci.math
csiph-web