Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #540344 > unrolled thread
| Started by | NewAge Prophet <newcalculusrocks@gmail.com> |
|---|---|
| First post | 2021-09-26 01:28 -0700 |
| Last post | 2021-09-27 23:24 -0700 |
| Articles | 20 on this page of 52 — 11 participants |
Back to article view | Back to sci.math
How to teach the fundamental theorem of calculus. NewAge Prophet <newcalculusrocks@gmail.com> - 2021-09-26 01:28 -0700
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-26 09:09 -0500
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-26 15:12 -0400
Re: How to teach the fundamental theorem of calculus. Eram semper recta <thenewcalculus@gmail.com> - 2021-09-26 23:07 -0700
Re: How to teach the fundamental theorem of calculus. Eram semper recta <thenewcalculus@gmail.com> - 2021-09-26 23:09 -0700
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-27 05:43 -0400
Re: How to teach the fundamental theorem of calculus. Kye Fox <rtrt@asd.cv> - 2021-09-27 09:45 +0000
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-27 05:49 -0400
Re: How to teach the fundamental theorem of calculus. Eram semper recta <thenewcalculus@gmail.com> - 2021-09-27 03:36 -0700
Re: How to teach the fundamental theorem of calculus. Eram semper recta <thenewcalculus@gmail.com> - 2021-09-27 03:44 -0700
Re: How to teach the fundamental theorem of calculus. Eram semper recta <thenewcalculus@gmail.com> - 2021-09-27 04:17 -0700
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-27 10:07 -0400
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-27 10:16 -0500
Re: How to teach the fundamental theorem of calculus. Michael Moroney <moroney@world.std.spaamtrap.com> - 2021-09-27 12:14 -0400
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-27 13:05 -0400
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-27 13:42 -0500
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-27 15:21 -0400
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-27 15:26 -0400
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-27 15:39 -0400
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-27 18:55 -0400
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-27 21:21 -0400
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-27 21:04 -0500
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-28 05:33 -0400
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-29 10:23 -0500
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-29 12:04 -0400
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-27 14:58 -0400
Re: How to teach the fundamental theorem of calculus. Eram semper recta <thenewcalculus@gmail.com> - 2021-09-28 01:18 -0700
Re: How to teach the fundamental theorem of calculus. "Freda Parkins" <invalid@invalid.invalid> - 2021-09-28 07:59 -0400
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-28 08:30 -0400
Re: How to teach the fundamental theorem of calculus. Michael Moroney <moroney@world.std.spaamtrap.com> - 2021-09-29 10:57 -0400
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-29 10:40 -0500
Re: How to teach the fundamental theorem of calculus. "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-09-27 21:51 -0700
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-27 10:09 -0500
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-27 08:20 -0400
Re: How to teach the fundamental theorem of calculus. Kye Fox <rtrt@asd.cv> - 2021-09-27 16:23 +0000
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-27 15:02 -0400
Re: How to teach the fundamental theorem of calculus. Kye Fox <rtrt@asd.cv> - 2021-09-27 19:48 +0000
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-27 19:12 -0400
Re: How to teach the fundamental theorem of calculus. Ho Im <hoo@imm.au> - 2021-09-29 15:14 +0000
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-29 10:41 -0500
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-29 14:09 -0400
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-29 19:09 -0500
Re: How to teach the fundamental theorem of calculus. Huy Dew <wre@df.we> - 2021-10-01 20:24 +0000
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-10-01 18:44 -0500
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-27 11:33 -0500
Re: How to teach the fundamental theorem of calculus. FromTheRafters <erratic@nomail.afraid.org> - 2021-09-27 15:07 -0400
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-27 21:07 -0500
Re: How to teach the fundamental theorem of calculus. Michael Moroney <moroney@world.std.spaamtrap.com> - 2021-09-27 12:05 -0400
Re: How to teach the fundamental theorem of calculus. Kye Fox <rtrt@asd.cv> - 2021-09-27 16:18 +0000
Re: How to teach the fundamental theorem of calculus. Serg io <invalid@invalid.com> - 2021-09-27 13:44 -0500
Re: How to teach the fundamental theorem of calculus. "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-09-26 21:45 -0700
STUDENTS BEWARE: Don't be a victim of JG's fake math Dan Christensen <Dan_Christensen@sympatico.ca> - 2021-09-27 23:24 -0700
Page 1 of 3 [1] 2 3 Next page →
| From | NewAge Prophet <newcalculusrocks@gmail.com> |
|---|---|
| Date | 2021-09-26 01:28 -0700 |
| Subject | How to teach the fundamental theorem of calculus. |
| Message-ID | <ac823212-26b1-4be0-b060-cb2ad2131d6bn@googlegroups.com> |
There are many problems teaching the Fundamental Theorem of Calculus in mainstream mathematics. The primary source of these problems is twofold: i. A fundamental misunderstanding of mathematics including the concept of number, area, volume, etc. ii. A deep-rooted conceptual ignorance about what is the fundamental theorem of calculus. A number is a name given to a measure that describes a size or magnitude. In my free article, I describe the above statement beginning with absolutely nothing: https://drive.google.com/file/d/1FDxd79p3ZF3pfr8VRDl7R9nqcWeWsdfu An area is generally defined as the product of two arithmetic means....... https://www.academia.edu/45154026/Teaching_the_fundamental_theorem_of_calculus A volume is generally defined as the product of _?_ arithmetic means. I watched parts of the following Wildberger video where he engages a mainstream math idiot (Daniel Rubin): https://www.youtube.com/watch?v=edh5bbgSKqo&t=2392s Of course both of them are lost and it's a classic case of the blind leading the blind. Norman Wildberger had agreed to debate me in a zoom meeting which was to be recorded and then chickened out.
[toc] | [next] | [standalone]
| From | Serg io <invalid@invalid.com> |
|---|---|
| Date | 2021-09-26 09:09 -0500 |
| Message-ID | <sipuu0$1t14$2@gioia.aioe.org> |
| In reply to | #540344 |
<snip crap> nothing
[toc] | [prev] | [next] | [standalone]
| From | "Freda Parkins" <invalid@invalid.invalid> |
|---|---|
| Date | 2021-09-26 15:12 -0400 |
| Message-ID | <siqgn2$4sd$1@gioia.aioe.org> |
| In reply to | #540344 |
>"NewAge Prophet" <newcalculusrocks@gmail.com> wrote in message >news:ac823212-26b1-4be0-b060-cb2ad2131d6bn@googlegroups.com... Hi John, I hope you're enjoying the weather in Athens. I have a simple question for you. It should be trivial for a genius with an IQ of 160. Does the decimal expansion of 28529647/9081269 terminate or repeat? If it repeats, how many digits does the repeating sequence have?
[toc] | [prev] | [next] | [standalone]
| From | Eram semper recta <thenewcalculus@gmail.com> |
|---|---|
| Date | 2021-09-26 23:07 -0700 |
| Message-ID | <4fe7b092-82a2-467a-a89a-b2c9de4bf2b7n@googlegroups.com> |
| In reply to | #540385 |
On Sunday, 26 September 2021 at 22:12:41 UTC+3, Freda Parkins wrote: > >"NewAge Prophet" <newcalcu...@gmail.com> wrote in message > >news:ac823212-26b1-4be0...@googlegroups.com... > > Hi John, > > I hope you're enjoying the weather in Athens. I do not live in Athens, just as I did not <<live>> in "Innisfree Village". Chuckle. When will you learn Freda? Athens is in Greece, but Greece is not Athens. I am a few hours away by plane and trust me, you would love to be where I am now and where I shall probably breathe my last. :) Why are you so obsessed with where I am located? Have I committed any crimes? I am whiter than snow. > > I have a simple question for you. It should be trivial for a genius with an > IQ of 160. > > Does the decimal expansion of 28529647/9081269 terminate or repeat? It can be reduced to 3 + 128584/9081269. So at some or other point, 128584/9081269 must repeat since neither 2 nor 5 are prime factors of 10. > If it repeats, how many digits does the repeating sequence have? Unremarkable and uninteresting. The most important number theorem in mathematics states that unless a number has the same prime factors (or multiples thereof) as base 10 (ie. 2 and 5), then said number will repeat in any attempted measure in base 10. https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH
[toc] | [prev] | [next] | [standalone]
| From | Eram semper recta <thenewcalculus@gmail.com> |
|---|---|
| Date | 2021-09-26 23:09 -0700 |
| Message-ID | <64f04082-1d0a-4be6-b548-0c67b52db193n@googlegroups.com> |
| In reply to | #540439 |
On Monday, 27 September 2021 at 09:07:31 UTC+3, Eram semper recta wrote: > On Sunday, 26 September 2021 at 22:12:41 UTC+3, Freda Parkins wrote: > > >"NewAge Prophet" <newcalcu...@gmail.com> wrote in message > > >news:ac823212-26b1-4be0...@googlegroups.com... > > > > Hi John, > > > > I hope you're enjoying the weather in Athens. > I do not live in Athens, just as I did not <<live>> in "Innisfree Village". Chuckle. When will you learn Freda? > > Athens is in Greece, but Greece is not Athens. I am a few hours away by plane and trust me, you would love to be where I am now and where I shall probably breathe my last. :) > > Why are you so obsessed with where I am located? Have I committed any crimes? I am whiter than snow. > > > > I have a simple question for you. It should be trivial for a genius with an > > IQ of 160. > > > > Does the decimal expansion of 28529647/9081269 terminate or repeat? > It can be reduced to 3 + 128584/9081269. So at some or other point, 128584/9081269 must repeat since neither 2 nor 5 are prime factors of 10. > > If it repeats, how many digits does the repeating sequence have? > Unremarkable and uninteresting. The most important number theorem in mathematics states that unless a number has the same prime factors (or multiples thereof) as base 10 (ie. 2 and 5), then said number will repeat in any attempted measure in base 10. > > https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH I could easily write a C or C++ program to determine after how many digits the sequence repeats. It would be as futile as trying to measure pi or square root of 2.
[toc] | [prev] | [next] | [standalone]
| From | "Freda Parkins" <invalid@invalid.invalid> |
|---|---|
| Date | 2021-09-27 05:43 -0400 |
| Message-ID | <sis3n7$lba$1@gioia.aioe.org> |
| In reply to | #540440 |
"Eram semper recta" <thenewcalculus@gmail.com> wrote in message news:64f04082-1d0a-4be6-b548-0c67b52db193n@googlegroups.com... > On Monday, 27 September 2021 at 09:07:31 UTC+3, Eram semper recta wrote: >> On Sunday, 26 September 2021 at 22:12:41 UTC+3, Freda Parkins wrote: >> > >"NewAge Prophet" <newcalcu...@gmail.com> wrote in message >> > >news:ac823212-26b1-4be0...@googlegroups.com... >> > >> > Hi John, >> > >> > I hope you're enjoying the weather in Athens. >> I do not live in Athens, just as I did not <<live>> in "Innisfree >> Village". Chuckle. When will you learn Freda? >> >> Athens is in Greece, but Greece is not Athens. I am a few hours away by >> plane and trust me, you would love to be where I am now and where I shall >> probably breathe my last. :) >> >> Why are you so obsessed with where I am located? Have I committed any >> crimes? I am whiter than snow. >> > >> > I have a simple question for you. It should be trivial for a genius >> > with an >> > IQ of 160. >> > >> > Does the decimal expansion of 28529647/9081269 terminate or repeat? >> It can be reduced to 3 + 128584/9081269. So at some or other point, >> 128584/9081269 must repeat since neither 2 nor 5 are prime factors of 10. >> > If it repeats, how many digits does the repeating sequence have? >> Unremarkable and uninteresting. The most important number theorem in >> mathematics states that unless a number has the same prime factors (or >> multiples thereof) as base 10 (ie. 2 and 5), then said number will repeat >> in any attempted measure in base 10. >> >> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH > > I could easily write a C or C++ program to determine after how many digits > the sequence repeats. It would be as futile as trying to measure pi or > square root of 2. In that case could you please easily write it in C++ and post it when you are done.
[toc] | [prev] | [next] | [standalone]
| From | Kye Fox <rtrt@asd.cv> |
|---|---|
| Date | 2021-09-27 09:45 +0000 |
| Message-ID | <sis3rc$k4b$1@gioia.aioe.org> |
| In reply to | #540458 |
Freda Parkins wrote: >>> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH >> >> I could easily write a C or C++ program to determine after how many >> digits the sequence repeats. It would be as futile as trying to measure >> pi or square root of 2. > > In that case could you please easily write it in C++ and post it when > you are done. why the hell it has to be a C++?? You guys are crazy like shit.
[toc] | [prev] | [next] | [standalone]
| From | "Freda Parkins" <invalid@invalid.invalid> |
|---|---|
| Date | 2021-09-27 05:49 -0400 |
| Message-ID | <sis433$rcv$1@gioia.aioe.org> |
| In reply to | #540459 |
"Kye Fox" <rtrt@asd.cv> wrote in message news:sis3rc$k4b$1@gioia.aioe.org... > Freda Parkins wrote: > >>>> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH >>> >>> I could easily write a C or C++ program to determine after how many >>> digits the sequence repeats. It would be as futile as trying to measure >>> pi or square root of 2. >> >> In that case could you please easily write it in C++ and post it when >> you are done. > > why the hell it has to be a C++?? You guys are crazy like shit. Why does it matter? You don't seriously think John will post any code do you? It's OK with me if he does it in BASIC.
[toc] | [prev] | [next] | [standalone]
| From | Eram semper recta <thenewcalculus@gmail.com> |
|---|---|
| Date | 2021-09-27 03:36 -0700 |
| Message-ID | <c2f8cb94-69f4-43a0-8f11-4d32ce38f059n@googlegroups.com> |
| In reply to | #540460 |
On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: > "Kye Fox" <rt...@asd.cv> wrote in message news:sis3rc$k4b$1...@gioia.aioe.org... > > Freda Parkins wrote: > > > >>>> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH > >>> > >>> I could easily write a C or C++ program to determine after how many > >>> digits the sequence repeats. It would be as futile as trying to measure > >>> pi or square root of 2. > >> > >> In that case could you please easily write it in C++ and post it when > >> you are done. > > > > why the hell it has to be a C++?? You guys are crazy like shit. > Why does it matter? You don't seriously think John will post any code do > you? > It's OK with me if he does it in BASIC. Why on earth would I do it for you? You've constantly libeled me. You've attacked me incessantly here on sci.math and elsewhere. You've tried to harm me through doxxing (good thing you failed because I have received many death threats from scum like you!). Besides, what's the point of finding out where the numbers repeat? It's unremarkable and useless. 9081269 is a prime number, so I am guessing it will probably repeat approx. every 9.081269 million digits depending on what kind of prime it is. For example, 17 is a prime number that if used as denominator repeats every 16 digits. If you're using 19, then it repeats every 18 digits. Big deal. I knew these things when I was 9 years old. I am not sure if this is the case with 9081269 and although I can easily find out, it's of no value to me. Why Freda, were you perhaps thinking of using the digits as a key for encryption? ROFLMAO I could crack such a key with my eyes closed. LMAO. Don't even think about it! See what a good man I am? I even warn you of your impending stupidity.
[toc] | [prev] | [next] | [standalone]
| From | Eram semper recta <thenewcalculus@gmail.com> |
|---|---|
| Date | 2021-09-27 03:44 -0700 |
| Message-ID | <f4f6f3ef-68b8-4aaa-9861-0fa4702ade31n@googlegroups.com> |
| In reply to | #540461 |
On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta wrote: > On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: > > "Kye Fox" <rt...@asd.cv> wrote in message news:sis3rc$k4b$1...@gioia.aioe.org... > > > Freda Parkins wrote: > > > > > >>>> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH > > >>> > > >>> I could easily write a C or C++ program to determine after how many > > >>> digits the sequence repeats. It would be as futile as trying to measure > > >>> pi or square root of 2. > > >> > > >> In that case could you please easily write it in C++ and post it when > > >> you are done. > > > > > > why the hell it has to be a C++?? You guys are crazy like shit. > > > Why does it matter? You don't seriously think John will post any code do > > you? > > It's OK with me if he does it in BASIC. > Why on earth would I do it for you? You've constantly libeled me. You've attacked me incessantly here on sci.math and elsewhere. You've tried to harm me through doxxing (good thing you failed because I have received many death threats from scum like you!). Besides, what's the point of finding out where the numbers repeat? It's unremarkable and useless. > > 9081269 is a prime number, so I am guessing it will probably repeat approx. every 9.081269 million digits depending on what kind of prime it is. > > For example, 17 is a prime number that if used as denominator repeats every 16 digits. If you're using 19, then it repeats every 18 digits. Big deal. I knew these things when I was 9 years old. I am not sure if this is the case with 9081269 and although I can easily find out, it's of no value to me. > > Why Freda, were you perhaps thinking of using the digits as a key for encryption? ROFLMAO > > I could crack such a key with my eyes closed. LMAO. Don't even think about it! See what a good man I am? I even warn you of your impending stupidity. Freda, learn about the most important number theorem here: https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH Baboons like you have never learned this knowledge. It answers ALL your questions about repeating digits. Go on now. Be a good girl and study it!
[toc] | [prev] | [next] | [standalone]
| From | Eram semper recta <thenewcalculus@gmail.com> |
|---|---|
| Date | 2021-09-27 04:17 -0700 |
| Message-ID | <13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com> |
| In reply to | #540464 |
On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta wrote: > On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta wrote: > > On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: > > > "Kye Fox" <rt...@asd.cv> wrote in message news:sis3rc$k4b$1...@gioia.aioe.org... > > > > Freda Parkins wrote: > > > > > > > >>>> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH > > > >>> > > > >>> I could easily write a C or C++ program to determine after how many > > > >>> digits the sequence repeats. It would be as futile as trying to measure > > > >>> pi or square root of 2. > > > >> > > > >> In that case could you please easily write it in C++ and post it when > > > >> you are done. > > > > > > > > why the hell it has to be a C++?? You guys are crazy like shit. > > > > > Why does it matter? You don't seriously think John will post any code do > > > you? > > > It's OK with me if he does it in BASIC. > > Why on earth would I do it for you? You've constantly libeled me. You've attacked me incessantly here on sci.math and elsewhere. You've tried to harm me through doxxing (good thing you failed because I have received many death threats from scum like you!). Besides, what's the point of finding out where the numbers repeat? It's unremarkable and useless. > > > > 9081269 is a prime number, so I am guessing it will probably repeat approx. every 9.081269 million digits depending on what kind of prime it is. > > > > For example, 17 is a prime number that if used as denominator repeats every 16 digits. If you're using 19, then it repeats every 18 digits. Big deal. I knew these things when I was 9 years old. I am not sure if this is the case with 9081269 and although I can easily find out, it's of no value to me. > > > > Why Freda, were you perhaps thinking of using the digits as a key for encryption? ROFLMAO > > > > I could crack such a key with my eyes closed. LMAO. Don't even think about it! See what a good man I am? I even warn you of your impending stupidity. > Freda, learn about the most important number theorem here: > > https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH > > Baboons like you have never learned this knowledge. It answers ALL your questions about repeating digits. > > Go on now. Be a good girl and study it! Repeating digits are for monkeys. Chimps are almost as good at pattern recognition as YOU are. Chuckle. Repeating digits are a consequence of not being able to measure a number in a given base. This is why 0.333... is not equal to 1/3 any more than 0.999... and 1 are thought to be equal by morons. Doesn't matter if pi digits were spewed out at 1 trillion per second forever because at any given time what you have is NOT pi, but a non-remarkable rational number that has all its digits in common with innumerably many other rational numbers. See? A futile exercise that indicates stupidity and ignorance rather than intelligence.
[toc] | [prev] | [next] | [standalone]
| From | "Freda Parkins" <invalid@invalid.invalid> |
|---|---|
| Date | 2021-09-27 10:07 -0400 |
| Message-ID | <sisj7s$l4a$1@gioia.aioe.org> |
| In reply to | #540465 |
"Eram semper recta" <thenewcalculus@gmail.com> wrote in message news:13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com... On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta wrote: > On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta wrote: > > On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: > > > "Kye Fox" <rt...@asd.cv> wrote in message > > > news:sis3rc$k4b$1...@gioia.aioe.org... > > > > Freda Parkins wrote: > > > > > > > >>>> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH > > > >>> > > > >>> I could easily write a C or C++ program to determine after how > > > >>> many > > > >>> digits the sequence repeats. It would be as futile as trying to > > > >>> measure > > > >>> pi or square root of 2. > > > >> > > > >> In that case could you please easily write it in C++ and post it > > > >> when > > > >> you are done. > > > > > > > > why the hell it has to be a C++?? You guys are crazy like shit. > > > > > Why does it matter? You don't seriously think John will post any code > > > do > > > you? > > > It's OK with me if he does it in BASIC. > > Why on earth would I do it for you? You've constantly libeled me. You've > > attacked me incessantly here on sci.math and elsewhere. You've tried to > > harm me through doxxing (good thing you failed because I have received > > many death threats from scum like you!). Besides, what's the point of > > finding out where the numbers repeat? It's unremarkable and useless. > > > > 9081269 is a prime number, so I am guessing it will probably repeat > > approx. every 9.081269 million digits depending on what kind of prime it > > is. > > > > For example, 17 is a prime number that if used as denominator repeats > > every 16 digits. If you're using 19, then it repeats every 18 digits. > > Big deal. I knew these things when I was 9 years old. I am not sure if > > this is the case with 9081269 and although I can easily find out, it's > > of no value to me. > > > > Why Freda, were you perhaps thinking of using the digits as a key for > > encryption? ROFLMAO > > > > I could crack such a key with my eyes closed. Well you did say "I could easily write a C or C++ program to determine after how many digits the sequence repeats." But now, when asked to produce the goods we get "Repeating digits are for monkeys." So I conclude that although you like to tell the world you have and IQ of 160 it's actually more like 115. >LMAO. Don't even think about it! See what a good man I am? I even warn you >of your impending stupidity. > Freda, learn about the most important number theorem here: > > https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH > > Baboons like you have never learned this knowledge. It answers ALL your > questions about repeating digits. > > Go on now. Be a good girl and study it! Repeating digits are for monkeys. Chimps are almost as good at pattern recognition as YOU are. Chuckle. Repeating digits are a consequence of not being able to measure a number in a given base. This is why 0.333... is not equal to 1/3 any more than 0.999... and 1 are thought to be equal by morons. Doesn't matter if pi digits were spewed out at 1 trillion per second forever because at any given time what you have is NOT pi, but a non-remarkable rational number that has all its digits in common with innumerably many other rational numbers. See? A futile exercise that indicates stupidity and ignorance rather than intelligence.
[toc] | [prev] | [next] | [standalone]
| From | Serg io <invalid@invalid.com> |
|---|---|
| Date | 2021-09-27 10:16 -0500 |
| Message-ID | <sisn94$n7d$1@gioia.aioe.org> |
| In reply to | #540475 |
On 9/27/2021 9:07 AM, Freda Parkins wrote: > "Eram semper recta" <thenewcalculus@gmail.com> wrote in message > news:13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com... > On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta wrote: >> On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta wrote: >>> On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: >>>> "Kye Fox" <rt...@asd.cv> wrote in message >>>> news:sis3rc$k4b$1...@gioia.aioe.org... >>>>> Freda Parkins wrote: >>>>> >>>>>>>> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH >>>>>>> >>>>>>> I could easily write a C or C++ program to determine after how >>>>>>> many >>>>>>> digits the sequence repeats. It would be as futile as trying to >>>>>>> measure >>>>>>> pi or square root of 2. >>>>>> >>>>>> In that case could you please easily write it in C++ and post it >>>>>> when >>>>>> you are done. >>>>> >>>>> why the hell it has to be a C++?? You guys are crazy like shit. >>> >>>> Why does it matter? You don't seriously think John will post any code >>>> do >>>> you? >>>> It's OK with me if he does it in BASIC. >>> Why on earth would I do it for you? You've constantly libeled me. You've >>> attacked me incessantly here on sci.math and elsewhere. You've tried to >>> harm me through doxxing (good thing you failed because I have received >>> many death threats from scum like you!). Besides, what's the point of >>> finding out where the numbers repeat? It's unremarkable and useless. >>> >>> 9081269 is a prime number, so I am guessing it will probably repeat >>> approx. every 9.081269 million digits depending on what kind of prime it >>> is. >>> >>> For example, 17 is a prime number that if used as denominator repeats >>> every 16 digits. If you're using 19, then it repeats every 18 digits. >>> Big deal. I knew these things when I was 9 years old. I am not sure if >>> this is the case with 9081269 and although I can easily find out, it's >>> of no value to me. >>> >>> Why Freda, were you perhaps thinking of using the digits as a key for >>> encryption? ROFLMAO >>> >>> I could crack such a key with my eyes closed. > > Well you did say "I could easily write a C or C++ program to determine after > how many digits the sequence repeats." > > But now, when asked to produce the goods we get "Repeating digits are for > monkeys." > > So I conclude that although you like to tell the world you have and IQ of > 160 it's actually more like 115. > >> LMAO. Don't even think about it! See what a good man I am? I even warn you >> of your impending stupidity. >> Freda, learn about the most important number theorem here: >> >> https://drive.google.com/file/d/1o5kcWvU35tdt_SY83UFnXZAlsKBAsSYH >> >> Baboons like you have never learned this knowledge. It answers ALL your >> questions about repeating digits. >> >> Go on now. Be a good girl and study it! > > Repeating digits are for monkeys. Chimps are almost as good at pattern > recognition as YOU are. Chuckle. Dear Freda, hmm... who uses the word "Chuckle" all the time ? Who uses "Baboon", "Chimps" and "monkey" references since he grew up in Africa ? Who fought for YEARS and YEARS that 0.999... is not equal to 1 ? Why Mr Rectum DOES !! , known as John Gabriel, or NewAgePervert, or FREDA, or LowIQ person of non-interest. Go Plow a Field. > > Repeating digits are a consequence of not being able to measure a number in > a given base. This is why 0.333... is not equal to 1/3 any more than > 0.999... and 1 are thought to be equal by morons. > > Doesn't matter if pi digits were spewed out at 1 trillion per second forever > because at any given time what you have is NOT pi, but a non-remarkable > rational number that has all its digits in common with innumerably many > other rational numbers. See? A futile exercise that indicates stupidity and > ignorance rather than intelligence. > >
[toc] | [prev] | [next] | [standalone]
| From | Michael Moroney <moroney@world.std.spaamtrap.com> |
|---|---|
| Date | 2021-09-27 12:14 -0400 |
| Message-ID | <sisqkq$kr9$1@gioia.aioe.org> |
| In reply to | #540480 |
On 9/27/2021 11:16 AM, Serg io wrote: > On 9/27/2021 9:07 AM, Freda Parkins wrote: >> Repeating digits are for monkeys. Chimps are almost as good at pattern >> recognition as YOU are. Chuckle. > > Dear Freda, > > hmm... who uses the word "Chuckle" all the time ? > > Who uses "Baboon", "Chimps" and "monkey" references since he grew up in Africa ? > > Who fought for YEARS and YEARS that 0.999... is not equal to 1 ? > > > Why Mr Rectum DOES !! , known as John Gabriel, or NewAgePervert, or FREDA, or LowIQ person of non-interest. > > > Go Plow a Field. "Freda" posts through AIOE, while Gabriel is a Giggle Grouper. Do you think Gabriel is smart enough to create a sock using AIOE?
[toc] | [prev] | [next] | [standalone]
| From | "Freda Parkins" <invalid@invalid.invalid> |
|---|---|
| Date | 2021-09-27 13:05 -0400 |
| Message-ID | <sistl7$9vk$1@gioia.aioe.org> |
| In reply to | #540480 |
"Serg io" <invalid@invalid.com> wrote in message news:sisn94$n7d$1@gioia.aioe.org... > On 9/27/2021 9:07 AM, Freda Parkins wrote: >> "Eram semper recta" <thenewcalculus@gmail.com> wrote in message >> news:13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com... >> On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta wrote: >>> On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta wrote: >>>> On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: >>>>> "Kye Fox" <rt...@asd.cv> wrote in message >>>>> news:sis3rc$k4b$1...@gioia.aioe.org... >>>>>> Freda Parkins wrote: >>>>>> > > > Go Plow a Field. > Would you mind if I plough it? Perhaps John could produce his solution in pseudocode. In other words, specify the requirements for the code without being language specific. Then you can code it for us in a language of your choice. Anything between BASIC and Rust is OK with me. Assembler is OK too if you can address enough RAM, but most people seem to have forgotten that it exists.
[toc] | [prev] | [next] | [standalone]
| From | Serg io <invalid@invalid.com> |
|---|---|
| Date | 2021-09-27 13:42 -0500 |
| Message-ID | <sit3a7$168d$1@gioia.aioe.org> |
| In reply to | #540504 |
On 9/27/2021 12:05 PM, Freda Parkins wrote: > "Serg io" <invalid@invalid.com> wrote in message > news:sisn94$n7d$1@gioia.aioe.org... >> On 9/27/2021 9:07 AM, Freda Parkins wrote: >>> "Eram semper recta" <thenewcalculus@gmail.com> wrote in message >>> news:13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com... >>> On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta wrote: >>>> On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta wrote: >>>>> On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: >>>>>> "Kye Fox" <rt...@asd.cv> wrote in message >>>>>> news:sis3rc$k4b$1...@gioia.aioe.org... >>>>>>> Freda Parkins wrote: >>>>>>> >> >> >> Go Plow a Field. >> > > Would you mind if I plough it? > > Perhaps John could produce his solution in pseudocode. > In other words, specify the requirements for the code without being language > specific. > > Then you can code it for us in a language of your choice. > > Anything between BASIC and Rust is OK with me. > > Assembler is OK too if you can address enough RAM, but most people seem to > have forgotten that it exists. > > agree, for sure => pseudo math needs to be in pseudo code, Best language would be FORTH for sure, stack machine in RPN
[toc] | [prev] | [next] | [standalone]
| From | "Freda Parkins" <invalid@invalid.invalid> |
|---|---|
| Date | 2021-09-27 15:21 -0400 |
| Message-ID | <sit5je$b3f$1@gioia.aioe.org> |
| In reply to | #540524 |
"Serg io" <invalid@invalid.com> wrote in message news:sit3a7$168d$1@gioia.aioe.org... > On 9/27/2021 12:05 PM, Freda Parkins wrote: >> "Serg io" <invalid@invalid.com> wrote in message >> news:sisn94$n7d$1@gioia.aioe.org... >>> On 9/27/2021 9:07 AM, Freda Parkins wrote: >>>> "Eram semper recta" <thenewcalculus@gmail.com> wrote in message >>>> news:13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com... >>>> On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta >>>> wrote: >>>>> On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta >>>>> wrote: >>>>>> On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: >>>>>>> "Kye Fox" <rt...@asd.cv> wrote in message >>>>>>> news:sis3rc$k4b$1...@gioia.aioe.org... >>>>>>>> Freda Parkins wrote: >>>>>>>> >>> >>> >>> Go Plow a Field. >>> >> >> Would you mind if I plough it? >> >> Perhaps John could produce his solution in pseudocode. >> In other words, specify the requirements for the code without being >> language >> specific. >> >> Then you can code it for us in a language of your choice. >> >> Anything between BASIC and Rust is OK with me. >> >> Assembler is OK too if you can address enough RAM, but most people seem >> to >> have forgotten that it exists. >> >> > > agree, for sure => pseudo math needs to be in pseudo code, > > Best language would be FORTH for sure, stack machine in RPN FORTRAN is OK too if you wish but since that's just BASIC without compulsory line numbers for most lines I expect you won't want to use that either.
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2021-09-27 15:26 -0400 |
| Message-ID | <sit5ut$ekh$1@dont-email.me> |
| In reply to | #540539 |
Freda Parkins expressed precisely : > "Serg io" <invalid@invalid.com> wrote in message > news:sit3a7$168d$1@gioia.aioe.org... >> On 9/27/2021 12:05 PM, Freda Parkins wrote: >>> "Serg io" <invalid@invalid.com> wrote in message >>> news:sisn94$n7d$1@gioia.aioe.org... >>>> On 9/27/2021 9:07 AM, Freda Parkins wrote: >>>>> "Eram semper recta" <thenewcalculus@gmail.com> wrote in message >>>>> news:13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com... >>>>> On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta wrote: >>>>>> On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta >>>>>> wrote: >>>>>>> On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: >>>>>>>> "Kye Fox" <rt...@asd.cv> wrote in message >>>>>>>> news:sis3rc$k4b$1...@gioia.aioe.org... >>>>>>>>> Freda Parkins wrote: >>>>>>>>> >>>> >>>> >>>> Go Plow a Field. >>>> >>> >>> Would you mind if I plough it? >>> >>> Perhaps John could produce his solution in pseudocode. >>> In other words, specify the requirements for the code without being >>> language >>> specific. >>> >>> Then you can code it for us in a language of your choice. >>> >>> Anything between BASIC and Rust is OK with me. >>> >>> Assembler is OK too if you can address enough RAM, but most people seem to >>> have forgotten that it exists. >>> >>> >> >> agree, for sure => pseudo math needs to be in pseudo code, >> >> Best language would be FORTH for sure, stack machine in RPN > > FORTRAN is OK too if you wish but since that's just BASIC without compulsory > line numbers for most lines I expect you won't want to use that either. FORTRAN is not like BASIC.
[toc] | [prev] | [next] | [standalone]
| From | "Freda Parkins" <invalid@invalid.invalid> |
|---|---|
| Date | 2021-09-27 15:39 -0400 |
| Message-ID | <sit6me$rip$1@gioia.aioe.org> |
| In reply to | #540544 |
"FromTheRafters" <erratic@nomail.afraid.org> wrote in message news:sit5ut$ekh$1@dont-email.me... > Freda Parkins expressed precisely : >> "Serg io" <invalid@invalid.com> wrote in message >> news:sit3a7$168d$1@gioia.aioe.org... >>> On 9/27/2021 12:05 PM, Freda Parkins wrote: >>>> "Serg io" <invalid@invalid.com> wrote in message >>>> news:sisn94$n7d$1@gioia.aioe.org... >>>>> On 9/27/2021 9:07 AM, Freda Parkins wrote: >>>>>> "Eram semper recta" <thenewcalculus@gmail.com> wrote in message >>>>>> news:13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com... >>>>>> On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta >>>>>> wrote: >>>>>>> On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta >>>>>>> wrote: >>>>>>>> On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins >>>>>>>> wrote: >>>>>>>>> "Kye Fox" <rt...@asd.cv> wrote in message >>>>>>>>> news:sis3rc$k4b$1...@gioia.aioe.org... >>>>>>>>>> Freda Parkins wrote: >>>>>>>>>> >>>>> >>>>> >>>>> Go Plow a Field. >>>>> >>>> >>>> Would you mind if I plough it? >>>> >>>> Perhaps John could produce his solution in pseudocode. >>>> In other words, specify the requirements for the code without being >>>> language >>>> specific. >>>> >>>> Then you can code it for us in a language of your choice. >>>> >>>> Anything between BASIC and Rust is OK with me. >>>> >>>> Assembler is OK too if you can address enough RAM, but most people seem >>>> to >>>> have forgotten that it exists. >>>> >>>> >>> >>> agree, for sure => pseudo math needs to be in pseudo code, >>> >>> Best language would be FORTH for sure, stack machine in RPN >> >> FORTRAN is OK too if you wish but since that's just BASIC without >> compulsory line numbers for most lines I expect you won't want to use >> that either. > > FORTRAN is not like BASIC. English humour isn't like US humour either :)
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2021-09-27 18:55 -0400 |
| Message-ID | <siti5n$6e6$1@dont-email.me> |
| In reply to | #540549 |
Freda Parkins was thinking very hard : > "FromTheRafters" <erratic@nomail.afraid.org> wrote in message > news:sit5ut$ekh$1@dont-email.me... >> Freda Parkins expressed precisely : >>> "Serg io" <invalid@invalid.com> wrote in message >>> news:sit3a7$168d$1@gioia.aioe.org... >>>> On 9/27/2021 12:05 PM, Freda Parkins wrote: >>>>> "Serg io" <invalid@invalid.com> wrote in message >>>>> news:sisn94$n7d$1@gioia.aioe.org... >>>>>> On 9/27/2021 9:07 AM, Freda Parkins wrote: >>>>>>> "Eram semper recta" <thenewcalculus@gmail.com> wrote in message >>>>>>> news:13e4000c-ad28-41b2-9e00-11b98a006634n@googlegroups.com... >>>>>>> On Monday, 27 September 2021 at 13:44:15 UTC+3, Eram semper recta >>>>>>> wrote: >>>>>>>> On Monday, 27 September 2021 at 13:36:21 UTC+3, Eram semper recta >>>>>>>> wrote: >>>>>>>>> On Monday, 27 September 2021 at 12:49:29 UTC+3, Freda Parkins wrote: >>>>>>>>>> "Kye Fox" <rt...@asd.cv> wrote in message >>>>>>>>>> news:sis3rc$k4b$1...@gioia.aioe.org... >>>>>>>>>>> Freda Parkins wrote: >>>>>>>>>>> >>>>>> >>>>>> >>>>>> Go Plow a Field. >>>>>> >>>>> >>>>> Would you mind if I plough it? >>>>> >>>>> Perhaps John could produce his solution in pseudocode. >>>>> In other words, specify the requirements for the code without being >>>>> language >>>>> specific. >>>>> >>>>> Then you can code it for us in a language of your choice. >>>>> >>>>> Anything between BASIC and Rust is OK with me. >>>>> >>>>> Assembler is OK too if you can address enough RAM, but most people seem >>>>> to >>>>> have forgotten that it exists. >>>>> >>>>> >>>> >>>> agree, for sure => pseudo math needs to be in pseudo code, >>>> >>>> Best language would be FORTH for sure, stack machine in RPN >>> >>> FORTRAN is OK too if you wish but since that's just BASIC without >>> compulsory line numbers for most lines I expect you won't want to use that >>> either. >> >> FORTRAN is not like BASIC. > > English humour isn't like US humour either :) I know another poster who uses that excuse.
[toc] | [prev] | [next] | [standalone]
Page 1 of 3 [1] 2 3 Next page →
Back to top | Article view | sci.math
csiph-web