We paper an iterative formula for factorizing a high degree polynomial into two polynomials numerically by solving some congruent equation with the aid of Euclidian algorithm. This polynomial factorization gives a fast algorithm as the name of a divide and conquer method for simultaneous calculation of all the zeros of a polynomial.
