Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2002
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2002

[Date Index] [Thread Index] [Author Index]

Search the Archive

196 algorithm

  • To: mathgroup at smc.vnet.net
  • Subject: [mg35158] 196 algorithm
  • From: "Jason Doucette" <JasonADoucette at hotmail.com>
  • Date: Thu, 27 Jun 2002 00:23:24 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

Hi Hans,

Regarding your post here:
http://library.wolfram.com/mathgroup/archive/1999/Oct/msg00083.html

You may be interested in my page:
http://www.jasondoucette.com/worldrecords.html

The way to speed up the algorithm is to use a real compiler, and use an
array to store individual digits.  There are methods for improvement beyond
this, but this is the main thing you need to concentrate on.

I have personally taken the quest to 13 million digits, and have passed it
on - the current record is over 30 million!

Jason Doucette
-------------------------
homepage: http://www.jasondoucette.com/
e-mail: JasonADoucette at hotmail.com
icq: 15860597




  • Prev by Date: help on backtesting
  • Next by Date: Mathematica code for the Anderson-Darling goodness of fit test
  • Previous by thread: Re: Re: help on backtesting
  • Next by thread: Mathematica code for the Anderson-Darling goodness of fit test