OpenEuphoria

Re: bignum progress report

• Posted by Christian.CUVIER at agriculture.gouv.fr Oct 28, 2002
• 444 views

Hi the list!

	Kat, could you tell us how the long string of 0's can happen?
	To put it frankly, I think that continued fractions are good for any
precision arithmetic, and Euphoria could be a good language to handle
them. Yes, transcendant functions (log, sin,...) are harder to code, but
you are much more secure about the precision of the result than with
ordibary multiplication, if only because you can directly control it.
And it is not that slower, also
	I had coded routines in 16-bit assembler for big numbers long ago (I
still think asm is best for really serious number crunching); I'd need
to rewrite everything to take advantage of MMX2 and Pentium
optimizations. Why not use some sort of cube algorithm on continued
fractions?

	Regards.

	Chris