
P<x> := PolynomialRing(GF(2));

for n in [100 .. 5000 by 200] do
    f := x^n + x + 1;
    f;
    L := Factorization(f);
    for t in L do
	assert IsIrreducible(t[1]);
    end for;
end for;

