In ``_minpoly1`` used a faster algorithm for some products.

The minimal polynomial of products of rational powers of integers are computed much faster in some cases.

In master
``minimal_polynomial(nsimplify(pi, tolerance=0.000000001))``
hangs (see https://github.com/sympy/sympy/pull/2234 and issue 4014)

Now it takes a fraction of a second.