Comment #3 on issue 3892 by [email protected]: powdenest won't denest a
product base (even with force=True)
http://code.google.com/p/sympy/issues/detail?id=3892
For the case of a product it mentions computing the gcd of bases or
exponents, neither of which are computable in the case you gave.
Given a product of powers raised to a power, ``(bb1**be1 *
bb2**be2...)**e``, simplification can be done as follows:
- if e is positive, the gcd of all bei can be joined with e;
var('i j k', positive=1)
(i, j, k)
powdenest((i**2*j**4)**k)
(i*j**2)**(2*k)
- all non-negative bb can be separated from those that are negative
and their gcd can be joined with e; autosimplification already
handles this separation.
I'm not sure what this one looks like :-(
--
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.
For more options, visit https://groups.google.com/groups/opt_out.
