Fabrizio Caruso wrote:
> Hi
>
> Is there a function that tests whether
> a polynomial is irreducible?
>
> In particular I am interested
> in polynomials over a finite field
> with prime number of elements.
>
There is no test that will ALWAYS work, short of factoring.
> I would like to avoid having to
> use "factor" and count the factors
> nor reimplement Berlekamp's algorithm.
>
>
Why would you reimplement this? Use the code in Maxima.