gfactor(2) => 2; similarly for gfactor(5), etc.
Correct result is (1+%i)*(1-%i) etc.
Same thing for factor(2,q^2+1) -- but note that
factorization isn't necessarily unique in this case, e.g.
This appears to be a documentation bug (although it
would be nice to handle gaussian integer factorization).
Factorization of integers is special-cased in the code,
but there is no special case for factorization of gaussian
integers. There do exist simple algorithms for this.
Perhaps I'll implement one someday....
Log in to post a comment.