Bill Allombert on Fri, 30 Jan 2004 21:03:18 +0100


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

bernfrac() faster than bernreal() 

Hello PARI-dev,

It seems that bernfrac() is much faster than bernreal() when
a high accuracy is required:

parisize = 4000000, primelimit = 500000
? \p2000
   realprecision = 2003 significant digits (2000 digits displayed)
? #
   timer = 1 (on)
? bernfrac(1000)*1.;
time = 10 ms.
? bernreal(1000);
time = 1,990 ms.

Cheers,
BIll.