-- Inspired from Mr. Howard Oakley. Might not qualify as "good",
-- but with this function I get log10(x)=849.114419903382
main = do
print(show(log10(x)))
x =
130142727215188116061276556022688196621810140343691778718485630367238262325689845541676397895906730024965277394371574303273329
On Wed, 30 Jun 2004 06:47:49 -0700 (PDT), Hal Daume III <[EMAIL PROTECTED]>
wrote:
>i'm looking for an accurate way to take the log of a very large integer,
>for example:
The standard algorithm works along these lines:
(Assume for the purposes of discussion that your numbers are represented
in
I would think to take an accurate (depends how you define
accurate) arbitrary precision floating point is needed...
gmp 2 supports this, but does not have a log function.
The power series is the way calculators do it... you could
always write a small library of operations on pairs of Integers
to d
At 06:47 30/06/04 -0700, Hal Daume III wrote:
i'm looking for an accurate way to take the log of a very large integer,
This may not help, but just in case... there is an effective (approximate)
algorithm for computing a log-gamma function, documented in "Numerical
Recipies" by Press/Flannery/Teuk
On 30/6/04 19:56, Howard Oakley wrote:
> - if the original number is an integer, the string length gives you the
> exponent, which in log10 forms the integer part of the result
Well, almost. The string length is actually 1 greater than the integer part
of the result, as log10(1) = 0.0, and log10(
On 30/6/04 14:47, Hal Daume III wrote:
> i'm looking for an accurate way to take the log of a very large integer,
> for example:
>
> let x :: Integer =
> 130142727215188116061276556022688196621810140343691778718485630367238262325689
> 845541676397895906730024965277394371574303273329260262483498
i'm looking for an accurate way to take the log of a very large integer,
for example:
let x :: Integer =
130142727215188116061276556022688196621810140343691778718485630367238262325689845541676397895906730024965277394371574303273329260262483498476173923323279461919361195473572028476105814689924
[Apologies if you receive this message more than once due to
cross-posting to relevant mailing lists]
+++ First Call for Participation +++
Dear colleague(s),
we would like to very cordially invite you to join us at the eighth
international
workshop on Cooperative Information Agents (CIA 2004) to
Dear Colleagues,
Below please find information about two workshops in Aarhus, Denmark,
Oktober 8-13 2004. Please notice that the deadline for submission of papers
is August 1.
CPN'04
Fifth Workshop and Tutorial on Practical Use of
Colour
[Appologies if you received multiple copies]
CALL FOR CONTRIBUTION: ICTAC 2004
FIRST INTERNATIONAL COLLOQUIUM ON THEORETICAL ASPECTS OF COMPUTING
Guiyang, China 20 - 24 September 2004
http://www.iist.unu.edu/ICTAC20
> Then we get the problem when we use difST in distString.
I no such problem.
The Glorious Glasgow Haskell Compilation System, version 6.3
ghc -H32m -Wall -O2 -fvia-C -optc-O2 -optc-march=pentium3 -optc-mfpmath=sse
-fexcess-precision -fliberate-case-threshold100 -funbox-strict-fields -threaded
11 matches
Mail list logo