One thing that is helpful is if you copy and paste your actual input
and output so it can be verified. Just remember to indent with 4
spaces your code. When I copy and past what you said you copied and
pasted I get True:
>>> test.subs({c1**2 : 1-s1**2, c2**2 : 1-s2**2, c3**3: 1-s3**2})
== c3*q2p*(1 - s2**2) + c3*q2p*s2**2*(1 - s1**2) - c2*q1p*s3*(1 -
s1**2)+ c3*q2p*s1**2*s2**2 - c2*q1p*s3*s1**2
True
BTW, before you spend a lot of time making these changes, I think it
would be good to discuss first whether we want this behavior to be
standard. Do we really prefer -1*(3 + 4*x) to -3 - 4*x? Because if we
can't reach a consensus the work will be in vain.
Also, when I gave this a try I got stuck at the examples in the
solving recurrence relationships, as I recall. I believe I left a note
in Mul.flatten just before the distribution step as I recall.
/c
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
