unrad modifications
use unrad in minimal_polynomial
select minimal factor from unrad result
use verified nsimplify in minimal_polynomial
nsimplify as fallback; check irreducible before factoring
radsimp modifications

Radsimp now handles the general solvable denominator that contains
4 radicals.

sign simplification is also employed on the return expression except
for the case where "sign trickery" is needed to keep the expression
from reverting to the original expression. It is perhaps a better idea
to use an unevaluated Mul with sorted args.

collect_sqrt is no longer used since that doesn't handle properly
the case for issue 2895.
define _addsort/_mulsort to identify its usage in codebase
always return a canonical unevaluated Mul from radsimp
merge unrad with master
remove print statement from simplify
remove unrad from minpoly
add _unevaluated_Mul to mul.py and modify _unevaluated_Add
align code and inline comments
use minpoly as fallback for radsimp; watch for Numbers

- also work with normal form of equation
remove minpoly use from radsimp

This is untraversed code at present and I'm not sure that there
are expressions that will make it to this point that will produce
a minimal polynomial that can be solve.
rework recursion and handle powers according to assumptions
omit processing only symbolic factors in denominators
Merge pull request #2023 from smichr/unrad

unrad and radsimp modifications