Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c > #13650 > unrolled thread
| Started by | 88888 Dihedral <dihedral88888@googlemail.com> |
|---|---|
| First post | 2011-11-20 11:12 -0800 |
| Last post | 2011-11-28 14:59 -0800 |
| Articles | 20 on this page of 89 — 25 participants |
Back to article view | Back to comp.lang.c
OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-20 11:12 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Ian Collins <ian-news@hotmail.com> - 2011-11-21 08:18 +1300
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Vincenzo Mercuri <vincenzo.mercuri@yahoo.it> - 2011-11-20 20:22 +0100
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-20 11:23 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Eric Sosman <esosman@ieee-dot-org.invalid> - 2011-11-20 15:03 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Kaz Kylheku <kaz@kylheku.com> - 2011-11-20 20:06 +0000
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-20 12:13 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Ian Collins <ian-news@hotmail.com> - 2011-11-21 09:16 +1300
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Eric Sosman <esosman@ieee-dot-org.invalid> - 2011-11-20 15:37 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Joe Pfeiffer <pfeiffer@cs.nmsu.edu> - 2011-11-20 14:15 -0700
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-20 13:45 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Malcolm McLean <malcolm.mclean5@btinternet.com> - 2011-11-21 00:44 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Phil Carmody <thefatphil_demunged@yahoo.co.uk> - 2011-11-21 12:44 +0200
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-21 10:41 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-21 00:53 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! "io_x" <a@b.c.invalid> - 2011-11-24 19:08 +0100
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Martin Ambuhl <mambuhl@earthlink.net> - 2011-11-20 17:32 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Keith Thompson <kst-u@mib.org> - 2011-11-20 14:55 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-20 16:54 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Keith Thompson <kst-u@mib.org> - 2011-11-20 19:35 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Nick Keighley <nick_keighley_nospam@hotmail.com> - 2011-11-22 00:39 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Keith Thompson <kst-u@mib.org> - 2011-11-22 13:18 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Nick Keighley <nick_keighley_nospam@hotmail.com> - 2011-11-24 01:50 -0800
Re: Euler's constant jacob navia <jacob@spamsink.net> - 2011-11-21 12:45 +0100
Re: Euler's constant Vincenzo Mercuri <vincenzo.mercuri@yahoo.it> - 2011-11-21 13:54 +0100
Re: Euler's constant jacob navia <jacob@spamsink.net> - 2011-11-21 14:48 +0100
Re: Euler's constant Vincenzo Mercuri <vincenzo.mercuri@yahoo.it> - 2011-11-21 18:58 +0100
Re: Euler's constant Markus Wichmann <nullplan@gmx.net> - 2011-11-21 14:10 +0100
Re: Euler's constant jacob navia <jacob@spamsink.net> - 2011-11-21 15:36 +0100
Re: Euler's constant 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-21 07:08 -0800
Re: Euler's constant jacob navia <jacob@spamsink.net> - 2011-11-21 16:16 +0100
Re: Euler's constant Nick Keighley <nick_keighley_nospam@hotmail.com> - 2011-11-22 00:44 -0800
Re: Euler's constant Ben Bacarisse <ben.usenet@bsb.me.uk> - 2011-11-21 15:33 +0000
Re: Euler's constant Malcolm McLean <malcolm.mclean5@btinternet.com> - 2011-11-21 08:50 -0800
Re: Euler's constant "BartC" <bc@freeuk.com> - 2011-11-21 17:13 +0000
Re: Euler's constant James Kuyper <jameskuyper@verizon.net> - 2011-11-21 12:29 -0500
Re: Euler's constant Malcolm McLean <malcolm.mclean5@btinternet.com> - 2011-11-21 09:28 -0800
Re: Euler's constant Ben Bacarisse <ben.usenet@bsb.me.uk> - 2011-11-21 23:07 +0000
Re: Euler's constant Kaz Kylheku <kaz@kylheku.com> - 2011-11-21 17:29 +0000
Re: Euler's constant James Kuyper <jameskuyper@verizon.net> - 2011-11-21 12:36 -0500
Re: Euler's constant Keith Thompson <kst-u@mib.org> - 2011-11-21 13:46 -0800
Re: Euler's constant "io_x" <a@b.c.invalid> - 2011-11-24 19:08 +0100
Re: Euler's constant Markus Wichmann <nullplan@gmx.net> - 2011-11-24 20:31 +0100
Re: Euler's constant "io_x" <a@b.c.invalid> - 2011-11-27 11:24 +0100
Re: Euler's constant Markus Wichmann <nullplan@gmx.net> - 2011-11-27 12:09 +0100
Re: Euler's constant "io_x" <a@b.c.invalid> - 2011-11-27 13:33 +0100
Re: Euler's constant Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-21 10:44 -0800
Re: Euler's constant Ben Bacarisse <ben.usenet@bsb.me.uk> - 2011-11-21 22:53 +0000
Re: Euler's constant Ben Bacarisse <ben.usenet@bsb.me.uk> - 2011-11-21 23:51 +0000
Re: Euler's constant 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-22 04:17 -0800
Re: Euler's constant 88888 Dihedral <dihedral88888@googlemail.com> - 2011-12-27 17:50 -0800
Re: Euler's constant Ben Bacarisse <ben.usenet@bsb.me.uk> - 2011-12-28 03:09 +0000
Re: Euler's constant 88888 Dihedral <dihedral88888@googlemail.com> - 2011-12-28 02:52 -0800
Re: Euler's constant Seebs <usenet-nospam@seebs.net> - 2011-12-28 18:17 +0000
Re: Euler's constant Dr Nick <3-nospam@temporary-address.org.uk> - 2011-12-28 18:49 +0000
Re: Euler's constant 88888 Dihedral <dihedral88888@googlemail.com> - 2012-01-04 04:44 -0800
Re: Euler's constant Robert Wessel <robertwessel2@yahoo.com> - 2012-01-04 12:33 -0600
Re: Euler's constant 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-21 15:07 -0800
Re: Euler's constant "io_x" <a@b.c.invalid> - 2011-11-24 19:08 +0100
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-21 04:00 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Kleuskes & Moos <kleuske@somewhere.else.net> - 2011-11-21 12:37 +0000
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-21 04:45 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Kleuskes & Moos <kleuske@somewhere.else.net> - 2011-11-21 13:35 +0000
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Phil Carmody <thefatphil_demunged@yahoo.co.uk> - 2011-11-22 00:01 +0200
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Kleuskes & Moos <kleuske@somewhere.else.net> - 2011-11-22 11:53 +0000
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Keith Thompson <kst-u@mib.org> - 2011-11-22 13:21 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Kleuske <kleuske@nowhere.net> - 2011-11-24 14:50 +0000
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! "io_x" <a@b.c.invalid> - 2011-11-24 14:08 +0100
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! "io_x" <a@b.c.invalid> - 2011-11-24 18:02 +0100
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-25 15:31 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-25 17:40 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-25 22:03 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-25 22:43 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Joe Wright <joewwright@comcast.net> - 2011-11-26 02:13 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-26 19:40 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! 88888 Dihedral <dihedral88888@googlemail.com> - 2011-11-27 15:35 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Ian Collins <ian-news@hotmail.com> - 2011-11-26 20:22 +1300
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-26 10:55 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Seebs <usenet-nospam@seebs.net> - 2011-11-28 08:32 +0000
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! superpollo <superpollo@tznvy.pbz> - 2011-11-26 12:11 +0100
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-26 10:37 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! superpollo <superpollo@tznvy.pbz> - 2011-11-26 21:48 +0100
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Keith Thompson <kst-u@mib.org> - 2011-11-28 01:56 -0800
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-28 13:34 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! James Kuyper <jameskuyper@verizon.net> - 2011-11-28 13:45 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Lew Pitcher <lpitcher@teksavvy.com> - 2011-11-28 13:50 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! James Kuyper <jameskuyper@verizon.net> - 2011-11-28 14:32 -0500
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Kleuske <kleuske@nowhere.net> - 2011-11-28 21:16 +0000
Re: OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! Keith Thompson <kst-u@mib.org> - 2011-11-28 14:59 -0800
Page 1 of 5 [1] 2 3 4 5 Next page →
| From | 88888 Dihedral <dihedral88888@googlemail.com> |
|---|---|
| Date | 2011-11-20 11:12 -0800 |
| Subject | OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!! |
| Message-ID | <24357587.77.1321816326271.JavaMail.geo-discussion-forums@prnv30> |
PROBLEM 1: COMPUTE THE EULER'S NUMBER UP TO 30 DIGITS AFTER 1. THE DIGIT REQUIRED SHOULD BE PARAMETER BY THE CALLER! PROBLEM 2: COMPUTE PI AS IN THE ABOVE! PROBLEM 3: LIST ALL PERMUTATIONS OF A STRING WITHOUT ANY REPEATED STRING IN THE LIST! PROBLEM 4: IMPLEMENT A HASH THAT COULD BE AS FAST AS POSSIBLE AND VERY STABLE AND ROBUST TO BE USED EVERYWHERE TO BEAT OTHER LANGUAGES WITH A HASH BUILT IN.
[toc] | [next] | [standalone]
| From | Ian Collins <ian-news@hotmail.com> |
|---|---|
| Date | 2011-11-21 08:18 +1300 |
| Message-ID | <9it24hF7g1U1@mid.individual.net> |
| In reply to | #13650 |
On 11/21/11 08:12 AM, 88888 Dihedral wrote: > PROBLEM 1: COMPUTE THE EULER'S NUMBER UP TO 30 DIGITS AFTER 1. > THE DIGIT REQUIRED SHOULD BE PARAMETER BY THE CALLER! > > PROBLEM 2: COMPUTE PI AS IN THE ABOVE! > > PROBLEM 3: LIST ALL PERMUTATIONS OF A STRING WITHOUT ANY REPEATED STRING IN THE LIST! > > PROBLEM 4: IMPLEMENT A HASH THAT COULD BE AS FAST AS POSSIBLE AND VERY STABLE AND ROBUST TO BE USED EVERYWHERE TO BEAT OTHER LANGUAGES WITH A HASH BUILT IN. Problem 5: Locate and turn off caps-lock. -- Ian Collins
[toc] | [prev] | [next] | [standalone]
| From | Vincenzo Mercuri <vincenzo.mercuri@yahoo.it> |
|---|---|
| Date | 2011-11-20 20:22 +0100 |
| Message-ID | <aIGdnU8p9LnxzlTTnZ2dnUVZ8kidnZ2d@giganews.com> |
| In reply to | #13650 |
88888 Dihedral ha scritto: > PROBLEM [...] I think we all would like to see a good effort on your part before providing source code for homework assignments. -- Vincenzo Mercuri | www.backbox.org
[toc] | [prev] | [next] | [standalone]
| From | 88888 Dihedral <dihedral88888@googlemail.com> |
|---|---|
| Date | 2011-11-20 11:23 -0800 |
| Message-ID | <12102041.2778.1321817018333.JavaMail.geo-discussion-forums@prou19> |
| In reply to | #13652 |
I solved those long time ago in C.
[toc] | [prev] | [next] | [standalone]
| From | Eric Sosman <esosman@ieee-dot-org.invalid> |
|---|---|
| Date | 2011-11-20 15:03 -0500 |
| Message-ID | <jabme3$42s$1@dont-email.me> |
| In reply to | #13653 |
On 11/20/2011 2:23 PM, 88888 Dihedral wrote:
> I solved those long time ago in C.
Glad to hear it. Just to verify, please post the output of
your Problem 3 solution for the string
I solved those long time ago in C
... and state whether you are considering or ignoring letter case,
so we can check your answer.
--
Eric Sosman
esosman@ieee-dot-org.invalid
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <kaz@kylheku.com> |
|---|---|
| Date | 2011-11-20 20:06 +0000 |
| Message-ID | <20111120120537.519@kylheku.com> |
| In reply to | #13656 |
On 2011-11-20, Eric Sosman <esosman@ieee-dot-org.invalid> wrote: > On 11/20/2011 2:23 PM, 88888 Dihedral wrote: >> I solved those long time ago in C. > > Glad to hear it. Just to verify, please post the output of > your Problem 3 solution for the string I like problem 4, because of its well-quantified and concretely targettable requirement: "as fast as possible".
[toc] | [prev] | [next] | [standalone]
| From | 88888 Dihedral <dihedral88888@googlemail.com> |
|---|---|
| Date | 2011-11-20 12:13 -0800 |
| Message-ID | <5463682.2028.1321820003319.JavaMail.geo-discussion-forums@prfx4> |
| In reply to | #13656 |
1. Define an order in the symbol set of the string by a sort. 2. Start from the smallest mapped by the ordered defined which will yield the maximum if reversed. 3. From the smallest string by the order defined, just generate the next until the maximum is reached. I hate to answer trivial questions!
[toc] | [prev] | [next] | [standalone]
| From | Ian Collins <ian-news@hotmail.com> |
|---|---|
| Date | 2011-11-21 09:16 +1300 |
| Message-ID | <9it5h9F7n9U1@mid.individual.net> |
| In reply to | #13658 |
On 11/21/11 09:13 AM, 88888 Dihedral wrote: > 1. Define an order in the symbol set of the string by a sort. > 2. Start from the smallest mapped by the ordered defined which will yield the maximum if reversed. > 3. From the smallest string by the order defined, just generate the next until the maximum is reached. > > I hate to answer trivial questions! Like you hate quoting context? -- Ian Collins
[toc] | [prev] | [next] | [standalone]
| From | Eric Sosman <esosman@ieee-dot-org.invalid> |
|---|---|
| Date | 2011-11-20 15:37 -0500 |
| Message-ID | <jaboe1$ght$1@dont-email.me> |
| In reply to | #13658 |
On 11/20/2011 3:13 PM, 88888 Dihedral wrote:
> 1. Define an order in the symbol set of the string by a sort.
> 2. Start from the smallest mapped by the ordered defined which will yield the maximum if reversed.
> 3. From the smallest string by the order defined, just generate the next until the maximum is reached.
>
> I hate to answer trivial questions!
I'm sure you'll be happy to learn that you're tied for third
place in my fastest-to-PLONK list.
--
Eric Sosman
esosman@ieee-dot-org.invalid
[toc] | [prev] | [next] | [standalone]
| From | Joe Pfeiffer <pfeiffer@cs.nmsu.edu> |
|---|---|
| Date | 2011-11-20 14:15 -0700 |
| Message-ID | <1bvcqelcmf.fsf@pfeifferfamily.net> |
| In reply to | #13650 |
88888 Dihedral <dihedral88888@googlemail.com> writes: > PROBLEM 1: COMPUTE THE EULER'S NUMBER UP TO 30 DIGITS AFTER 1. > THE DIGIT REQUIRED SHOULD BE PARAMETER BY THE CALLER! > > PROBLEM 2: COMPUTE PI AS IN THE ABOVE! > > PROBLEM 3: LIST ALL PERMUTATIONS OF A STRING WITHOUT ANY REPEATED STRING IN THE LIST! > > PROBLEM 4: IMPLEMENT A HASH THAT COULD BE AS FAST AS POSSIBLE AND VERY STABLE AND ROBUST TO BE USED EVERYWHERE TO BEAT OTHER LANGUAGES WITH A HASH BUILT IN. Please provide the email address of your instructor, so we can submit our homework directly. Also, please do something about your broken caps-lock key.
[toc] | [prev] | [next] | [standalone]
| From | Lew Pitcher <lpitcher@teksavvy.com> |
|---|---|
| Date | 2011-11-20 13:45 -0800 |
| Message-ID | <a0d5ed94-14f5-443b-a68f-09ec29e30eff@o5g2000yqa.googlegroups.com> |
| In reply to | #13650 |
On Nov 20, 2:12 pm, 88888 Dihedral <dihedral88...@googlemail.com> wrote: > PROBLEM 1: COMPUTE THE EULER'S NUMBER UP TO 30 DIGITS AFTER 1. > THE DIGIT REQUIRED SHOULD BE PARAMETER BY THE CALLER! "Euler's Number"? Do you mean "the mathematical constant e"? Or perhaps "a sequence En of integers defined by a specific Taylor series expansion"? If you mean /e/, then a) the number starts with a /2/, not a /1/ (as in 2.718281828...), b) Steve Wozniak published a solution to 116000 places, in 1981, and c) /I/ wrote and published a C-language solution to 5000 places in the 1990s What's so difficult about a /30 place/ solution? > PROBLEM 2: COMPUTE PI AS IN THE ABOVE! It's been done. Many times over. > PROBLEM 3: LIST ALL PERMUTATIONS OF A STRING WITHOUT ANY REPEATED STRING IN THE > LIST! A little more difficult, but again, it's been done many times over. > PROBLEM 4: IMPLEMENT A HASH THAT COULD BE AS FAST AS POSSIBLE AND VERY STABLE AND > ROBUST TO BE USED EVERYWHERE TO BEAT OTHER LANGUAGES WITH A HASH BUILT IN. Again, it's been done, many times. And it's simpler than e or pi. So, what's your point? Or is this a sad attempt to get others to do your homework for you?
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.mclean5@btinternet.com> |
|---|---|
| Date | 2011-11-21 00:44 -0800 |
| Message-ID | <8ba4d98f-b555-484c-8586-d585b9da15e3@q11g2000vbq.googlegroups.com> |
| In reply to | #13663 |
On Nov 20, 11:45 pm, Lew Pitcher <lpitc...@teksavvy.com> wrote: > > "Euler's Number"? Do you mean "the mathematical constant e"? > That is Euler's number. The confusion arises because e doesn't stand for "Euler". He chose it because other mathematicians had already bagged a, b, c, and d for other uses. The C programming language was named on the same system. -- Brand new: seqlogo generator http://www.malcolmmclean.site11.com/www
[toc] | [prev] | [next] | [standalone]
| From | Phil Carmody <thefatphil_demunged@yahoo.co.uk> |
|---|---|
| Date | 2011-11-21 12:44 +0200 |
| Message-ID | <87y5v97o0m.fsf@bazspaz.fatphil.org> |
| In reply to | #13685 |
Malcolm McLean <malcolm.mclean5@btinternet.com> writes: > On Nov 20, 11:45 pm, Lew Pitcher <lpitc...@teksavvy.com> wrote: > > > > "Euler's Number"? Do you mean "the mathematical constant e"? > > > That is Euler's number. Except when one of them's ~2.781828 and the other one's ~0.577215665. Better to include either the e or the gamma in the name to reduce ambiguity. Phil -- Unix is simple. It just takes a genius to understand its simplicity -- Dennis Ritchie (1941-2011), Unix Co-Creator
[toc] | [prev] | [next] | [standalone]
| From | Lew Pitcher <lpitcher@teksavvy.com> |
|---|---|
| Date | 2011-11-21 10:41 -0800 |
| Message-ID | <0aa764a3-3e1e-4808-8e49-8530919819dd@t16g2000vba.googlegroups.com> |
| In reply to | #13685 |
On Nov 21, 3:44 am, Malcolm McLean <malcolm.mcle...@btinternet.com>
wrote:
> On Nov 20, 11:45 pm, Lew Pitcher <lpitc...@teksavvy.com> wrote:
>
> > "Euler's Number"? Do you mean "the mathematical constant e"?
>
> That is Euler's number.
>
https://www.google.com/search?q=euler%27s+number
Hit #1 leads to
http://en.wikipedia.org/wiki/E_%28mathematical_constant%29
"The mathematical constant e is the unique real number such that the
value of the
derivative (slope of the tangent line) of the function f(x) = ex at
the point x = 0
is equal to 1."
Hit #2 leads to
http://en.wikipedia.org/wiki/Euler_number
"In the area of number theory, the Euler numbers are a sequence En
of integers
(sequence A122045 in OEIS) defined by the following Taylor series
expansion:
\frac{1}{\cosh t} = \frac{2}{e^{t} + e^ {-t} } = \sum_{n=0}
^{\infin}
\frac{E_n}{n!} \cdot t^n\!
where cosh t is the hyperbolic cosine."
I /believed/ that the OP meant #1 ("Euler's Number" aka /e/), but his
vague reference to the integer portion of the value being 1 lead me to
wonder if I was wrong.
[toc] | [prev] | [next] | [standalone]
| From | 88888 Dihedral <dihedral88888@googlemail.com> |
|---|---|
| Date | 2011-11-21 00:53 -0800 |
| Message-ID | <30316869.383.1321865607922.JavaMail.geo-discussion-forums@prmf13> |
| In reply to | #13663 |
On Monday, November 21, 2011 5:45:22 AM UTC+8, Lew Pitcher wrote: > On Nov 20, 2:12 pm, 88888 Dihedral <dihedr...@googlemail.com> > wrote: > > PROBLEM 1: COMPUTE THE EULER'S NUMBER UP TO 30 DIGITS AFTER 1. > > THE DIGIT REQUIRED SHOULD BE PARAMETER BY THE CALLER! > > "Euler's Number"? Do you mean "the mathematical constant e"? Or > perhaps "a sequence En of integers defined by a specific Taylor series > expansion"? > > If you mean /e/, then > a) the number starts with a /2/, not a /1/ (as in 2.718281828...), > b) Steve Wozniak published a solution to 116000 places, in 1981, and > c) /I/ wrote and published a C-language solution to 5000 places in the > 1990s > What's so difficult about a /30 place/ solution? > > > PROBLEM 2: COMPUTE PI AS IN THE ABOVE! > > It's been done. Many times over. > > > PROBLEM 3: LIST ALL PERMUTATIONS OF A STRING WITHOUT ANY REPEATED STRING IN THE > > LIST! > > A little more difficult, but again, it's been done many times over. > > > PROBLEM 4: IMPLEMENT A HASH THAT COULD BE AS FAST AS POSSIBLE AND VERY STABLE AND > > ROBUST TO BE USED EVERYWHERE TO BEAT OTHER LANGUAGES WITH A HASH BUILT IN. > > Again, it's been done, many times. And it's simpler than e or pi. > > So, what's your point? Or is this a sad attempt to get others to do > your homework for you? I am talking about language features to be checked to be used as a tool to solve problems.
[toc] | [prev] | [next] | [standalone]
| From | "io_x" <a@b.c.invalid> |
|---|---|
| Date | 2011-11-24 19:08 +0100 |
| Message-ID | <4ece8773$0$1387$4fafbaef@reader2.news.tin.it> |
| In reply to | #13687 |
"88888 Dihedral" <dihedral88888@googlemail.com> ha scritto nel messaggio news:30316869.383.1321865607922.JavaMail.geo-discussion-forums@prmf13... On Monday, November 21, 2011 5:45:22 AM UTC+8, Lew Pitcher wrote: > On Nov 20, 2:12 pm, 88888 Dihedral <dihedr...@googlemail.com> > wrote: > > PROBLEM 1: COMPUTE THE EULER'S NUMBER UP TO 30 DIGITS AFTER 1. > > THE DIGIT REQUIRED SHOULD BE PARAMETER BY THE CALLER! > What's so difficult about a /30 place/ solution? .... > So, what's your point? Or is this a sad attempt to get others to do > your homework for you? I am talking about language features to be checked to be used as a tool to solve problems. io_x> i agree with you good answer
[toc] | [prev] | [next] | [standalone]
| From | Martin Ambuhl <mambuhl@earthlink.net> |
|---|---|
| Date | 2011-11-20 17:32 -0500 |
| Message-ID | <jabv5s$u0l$1@dont-email.me> |
| In reply to | #13650 |
On 11/20/2011 2:12 PM, 88888 Dihedral wrote: > PROBLEM 1: COMPUTE THE EULER'S NUMBER UP TO 30 DIGITS AFTER 1. > THE DIGIT REQUIRED SHOULD BE PARAMETER BY THE CALLER! > > PROBLEM 2: COMPUTE PI AS IN THE ABOVE! > > PROBLEM 3: LIST ALL PERMUTATIONS OF A STRING WITHOUT ANY REPEATED STRING IN THE LIST! > > PROBLEM 4: IMPLEMENT A HASH THAT COULD BE AS FAST AS POSSIBLE AND VERY STABLE AND ROBUST TO BE USED EVERYWHERE TO BEAT OTHER LANGUAGES WITH A HASH BUILT IN. The subject line "OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!!" is a lie. It should read: "a cretin who can't turn off his shift lock and engages in childish multiple exclamation marks wants someone else to do his homework." Or just "Dihedral is a troll, please ignore."
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <kst-u@mib.org> |
|---|---|
| Date | 2011-11-20 14:55 -0800 |
| Message-ID | <lnehx2wghw.fsf@nuthaus.mib.org> |
| In reply to | #13664 |
Martin Ambuhl <mambuhl@earthlink.net> writes:
> On 11/20/2011 2:12 PM, 88888 Dihedral wrote:
>> PROBLEM 1: COMPUTE THE EULER'S NUMBER UP TO 30 DIGITS AFTER 1.
>> THE DIGIT REQUIRED SHOULD BE PARAMETER BY THE CALLER!
>>
>> PROBLEM 2: COMPUTE PI AS IN THE ABOVE!
>>
>> PROBLEM 3: LIST ALL PERMUTATIONS OF A STRING WITHOUT ANY REPEATED STRING IN THE LIST!
>>
>> PROBLEM 4: IMPLEMENT A HASH THAT COULD BE AS FAST AS POSSIBLE AND VERY STABLE AND ROBUST TO BE USED EVERYWHERE TO BEAT OTHER LANGUAGES WITH A HASH BUILT IN.
>
> The subject line "OK. LETS START REAL PROGRAMMING IN C FOR PROBLEMS!!!"
> is a lie. It should read: "a cretin who can't turn off his shift lock
> and engages in childish multiple exclamation marks wants someone else to
> do his homework." Or just "Dihedral is a troll, please ignore."
Quite possibly, but it's also possible that the OP has seen the
recent spate of off-topic flaming and is making a clumsy attempt
to encourage actual discussion of C programming.
Perhaps we should consider following his example, if not his
typography.
Some advice to 88888 Dihedral:
1. Don't post in all-caps. It's considered equivalent to shouting, and
is generally seen as rude. Same for exclamation points.
2. Questions about actual problems you've encountered are more likely to
generate good answers than contrived puzzles (unless the puzzles are
particularly interesting, but frankly these aren't).
--
Keith Thompson (The_Other_Keith) kst-u@mib.org <http://www.ghoti.net/~kst>
"We must do something. This is something. Therefore, we must do this."
-- Antony Jay and Jonathan Lynn, "Yes Minister"
[toc] | [prev] | [next] | [standalone]
| From | 88888 Dihedral <dihedral88888@googlemail.com> |
|---|---|
| Date | 2011-11-20 16:54 -0800 |
| Message-ID | <18893293.2986.1321836873742.JavaMail.geo-discussion-forums@prou19> |
| In reply to | #13665 |
There was some library for big numbers written C. Of course, printing the big numbers won't be the same as printing native types. With other languages supporting big numbers C with some libraries seems not attractive to novices.
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <kst-u@mib.org> |
|---|---|
| Date | 2011-11-20 19:35 -0800 |
| Message-ID | <ln62iew3ja.fsf@nuthaus.mib.org> |
| In reply to | #13669 |
88888 Dihedral <dihedral88888@googlemail.com> writes:
> There was some library for big numbers written C. Of course, printing
> the big numbers won't be the same as printing native types. With other
> languages supporting big numbers C with some libraries seems not
> attractive to novices.
If you're actually interested in particating here, then please
(a) format your text in lines shorter than 80 columns, preferably
around 72 and (b) quote some context from the article to which you're
replying (see 99% of the followups here for examples; Google Groups
can make this difficult, but the "old" interface isn't as bad as
the new one).
--
Keith Thompson (The_Other_Keith) kst-u@mib.org <http://www.ghoti.net/~kst>
"We must do something. This is something. Therefore, we must do this."
-- Antony Jay and Jonathan Lynn, "Yes Minister"
[toc] | [prev] | [next] | [standalone]
Page 1 of 5 [1] 2 3 4 5 Next page →
Back to top | Article view | comp.lang.c
csiph-web