Comment #10 on issue 2895 by [email protected]: minpoly hangs on this
expresion
http://code.google.com/p/sympy/issues/detail?id=2895
unrad is faster for this non-trivial case:
timeit('unrad((sqrt(2)/3 + 7)**(S(1)/4) + sqrt(sqrt(2)/3 + 7) - x,
all=True)
', '''
... from sympy import S, sqrt
... from sympy.solvers.solvers import unrad\nfrom sympy.abc import x''',
number=
100)
8.3255302590645925
timeit('f((sqrt(2)/3 + 7)**(S(1)/4) + sqrt(sqrt(2)/3 + 7))', '''
... from sympy import S, sqrt, minimal_polynomial as f
... from sympy.abc import x
... ''', number=100)
16.321116133041045
What I don't know how to guarantee, however, is whether unrad will always
pick the correct pair of radicals to group when exponentiating. I also
don't know if there is a way to know if an expression *can* be reduced to a
minimal polynomial. Although unrad says it can't make progress on the OP
expression, is it right or will the 7 equations in 7 unknowns (comment #1)
eventually lead to a minimal polynomial? And the irreducible issue is
currently outside of my knowledge base. So...I have more questions than
answers...
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sympy-issues?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
