Proving geometric algorithm non-solvability: An application of factoring polynomials