# whats happening ?

**Jason Moxham
**
J.L.Moxham@maths.soton.ac.uk

*Tue, 22 Oct 2002 00:26:30 +0100*

I done some preliminary work on a few algorithms ,and even in a completel=
y=20
un-optimized form have got some good results for some of the following=20
functions , other results , not so good :( =20
mpz_root using varible precision , division free newton method
mpz_rootexact (like mpz_divexact but for roots) using varible precision =
,=20
division free p-adic newton method
mpz_perfect_power_p using parts of the above fn's
mpz_invert_2exp (like mpz_invert but 2^n modulas) again using above p-adi=
cs
mpz_tdiv_q using varible precision , division free newton method
Before I go ahead with anymore tweaking , is anyone else working on any o=
f=20
these fn's or plans to ?
Most of this is based on=20
http://cr.yp.to/papers/powers.ps
I suppose I should also look at the generalization of the karatsuba squar=
e=20
root method .
One other thing , I also have a (slow)implementation of mpz_kronecker usi=
ng=20
the accelerated gcd algorithm , its only twice as fast for about 100000 l=
imbs=20
I will have quite a bit of free time so might as well do something useful
jason