The basic facts about separable extensions of discrete fields and factoring polynomials are developed in the constructive spirit of Errett Bishop. The ability to factor polynomials is shown to be ...

Abstract: It is well known there is no closed form for the roots of general polynomials with degree over four. Thus, in essence, all roots finding algorithms are approximate methods, which may also ...