I am using an Ubuntu 64 bit CSL based **Reduce** install.

I was trying the polynomial factor problem shown at,

http://krum.rz.uni-mannheim.de/cabench/mupadvzg.html

x^500+x+1 modulo nextprime(ceiling(pi * 2^500))

However, I am getting the error message that modulus is too big. After googling, it seems that modulo **factorize** is limited to *largest!-small!-modulus* value. In my install it's value is 16777215 or 24 bits. :-( So the algorithm is limited to small integers.

Is there another package that can handle large modulus problems?