Scratch that. It looks like Pari will work as it can handle ints as large as 2^(2^29). I misread it as 2^29. :) On Mar 13, 2006, at 5:33 PM, Jay Austad wrote: > Pari looks interesting. I'm reading the docs, and it doesn't look > like it will handle the size of the numbers I'm dealing with > (2^4000000000 and larger). I've used some approximation techniques > to get my answer, however, I've tried 3 of them, and they all give me > numbers that are way different. I need an exact answer. Eventually, > I need a way to do this calculation fast too. Does anyone here have > a really good understanding of math and experience with FPGA's? > > On Mar 13, 2006, at 5:11 PM, Florin Iucha wrote: > >> On Mon, Mar 13, 2006 at 04:43:03PM -0600, Jay Austad wrote: >>> I need to do some calculations on very large numbers, and bc won't >>> handle it. Does anyone know if a good tool which doesn't really >>> have >>> a limit on the size of numbers that it can deal with? Something >>> preferably free, I only really need to do one calculation to find >>> out >>> the probability of something, but it's fairly complex and has huge >>> numbers in it. >> >> Pari: >> >> http://pari.math.u-bordeaux.fr/ >> >> http://www.its.caltech.edu/~dw/maths/PARI.pdf >> >> florin >> >> -- >> Don't question authority: they don't know either! >> _______________________________________________ >> TCLUG Mailing List - Minneapolis/St. Paul, Minnesota >> tclug-list at mn-linux.org >> http://mailman.mn-linux.org/mailman/listinfo/tclug-list > > > _______________________________________________ > TCLUG Mailing List - Minneapolis/St. Paul, Minnesota > tclug-list at mn-linux.org > http://mailman.mn-linux.org/mailman/listinfo/tclug-list >