good point. the amount of calculation is exponential... If some are interested, i can send you a blog i just wrote but never would send to the list - lengthy, obscure and technical - but it's interesting, explains it in layman terms and has a slow solution to make it work in rev with hints for a faster version...
Time is not there alas ;) The right tool for the job... Mathematica is the very best i know but not always accessible... GNU lib i dont know but i'll give it a loot at given time ;) This for a really big big prime i'd like to figure out ;)... In decimal notation in ascii (revstrings) my prime candidate number takes some 600MBs uncompressed. 30MBs compressed with Zip. I can write it in less than 10 characters and it takes rev 10 minutes to write it down! But i cant compute it yet. Adding or subtracting simple you might say... but... go ahead, be my guest take your time! ;) cheers Xav > -----Original Message----- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf Of > Victor Eijkhout > Sent: Tuesday, May 24, 2005 18:12 > To: How to use Revolution > Subject: Re: Infinite-precision arithmetic > > > On May 24, 2005, at 5:02 AM, [EMAIL PROTECTED] wrote: > > > I've just started to work on a suite of handlers for > > infinite-precision calculations. > > Wouldn't it be easier to interface to an existing bigint library? > Doesn't the Gnu Scientific Library have this stuff? > > V. > > _______________________________________________ > use-revolution mailing list > use-revolution@lists.runrev.com > http://lists.runrev.com/mailman/listinfo/use-revolution > _______________________________________________ use-revolution mailing list use-revolution@lists.runrev.com http://lists.runrev.com/mailman/listinfo/use-revolution