Am 26 Nov 2005 um 17:12 hat Alasdair McAndrew geschrieben:
> The trouble with the functions you mention is that they are designed
> to work with polynomials, and have poor efficiency on integers. But I
> will check out ifactor.lisp - it sounds very promising!
>
> cheers,
> Alasdair
>
> >
> > Maxima functions EZGCD, GCD, GCDEX, FACTOR, ....
> >
Alasdair,
you mention poor efficiency on integers. I will check this.
I have some binary code for gcd, gcdex and invmod for integers on my computer.
I will write it in Lisp code and let you know, if there will be a much better efficiency.
Another question is, if the following result is acceptable.
(%i2) gcdex(144,36,1);
1
(%o2)/R/ [0, --, 1]
36
Or should we have [0,1,36] as result?
The question of perhaps writing integer versions of some number theory functions
touches again the question of Maximas modulo calculations. From my point of view, mod
7 should only give the results 0,1,...,6.
cheers
Volker van Nek