Probabilistic absolute irreducibility test for polynomials

The absolute irreducibility of a polynomial with rational coefficients can usually be proved by detecting rational conditions on one of its reductions modulo some prime numbers. We show that the probability for these conditions to be realized is very high. The resulting fast algorithm is thus a good preliminary step for absolute factorization procedures of computer algebra systems.