Identify every p where encoding beats one unencoded bit

Identify every p where encoding beats one unencoded bit

Solve the inequality between the logical error polynomial and p exactly over [0,1], then confirm the crossing points and the direction of the inequality on each side. Deliverable: A solved interval set with exact crossing points and a checker that tests sample values inside and outside each interval.