code: func (x Pol) Irreducible() bool {
  	for i := 1; i <= x.Deg()/2; i++ {
  		if x.GCD(qp(uint(i), x)) != 1 {
  			return false
  		}
  	}
  
  	return true
  }
docs: // Irreducible returns true iff x is irreducible over F_2. This function
  // uses Ben Or's reducibility test.
  //
  // For details see "Tests and Constructions of Irreducible Polynomials over
  // Finite Fields".