faster numerical evaluation in ``choose_factor``
always return a canonical unevaluated Mul from radsimp
Merge pull request #1993 from pernici/nthroot

nthroot of a sum of surds
merge unrad with master
remove print statement from simplify
3562: Replace Method for MutableMatrix
Missing translations for tutorial.ru.po (issue 3526)
Correct Pow.as_real_imag() for im=0 (see issue 3474)

    This was fixed before for issue 3162, see PR #1161
Code quality improved
Support for map argument added
Merge pull request #2026 from skirpichev/3474-fix-as_real_imag

Correct Pow.as_real_imag() for im=0 (see issue 3474)
remove unrad from minpoly
Test added for map. Code Now compliant with PEP8
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