Updates:
Status: Invalid
Comment #1 on issue 3549 by smi...@gmail.com: totient and totient_ are
identical (?)
http://code.google.com/p/sympy/issues/detail?id=3549
Are you looking at an old version of SymPy?
commit 5257b4759900331b832e67e55190bacf0d8bc8ad
Author: Bharath M R
Date:
Comment #3 on issue 3545 by smi...@gmail.com: solving a complicated
expression with square roots
http://code.google.com/p/sympy/issues/detail?id=3545
I'm not sure why unrad is not attempted, but if you use it you obtain:
eq
-sqrt((m - q)**2 + (-m/(2*q) + 1/2)**2) + sqrt((-m**2/2 - sqrt(4*m
Comment #3 on issue 3563 by smi...@gmail.com: Implement faster
combinatorial enumeration algorithms
http://code.google.com/p/sympy/issues/detail?id=3563
Naming - should I just put underscores in front of
multiset_partitions_taocp and its visitor functions, and then wire
it in to the mul
Comment #3 on issue 3574 by asmeu...@gmail.com: live.sympy.org/#example
should show an open example tab in sidebar
http://code.google.com/p/sympy/issues/detail?id=3574
That last url has a strange printing issue (some of the input text is LaTeX
printed). I can't reproduce it without the url,
Comment #4 on issue 3565 by asmeu...@gmail.com: Sum(x**n, (n, 0,
oo)).doit() is wrong
http://code.google.com/p/sympy/issues/detail?id=3565
It seems that it no longer sees that summation(2**n, (n, 1, oo)) is oo if
you do this. The fix I guess would be to add a new check if the base is
num
Comment #2 on issue 3563 by pkrathma...@gmail.com: Implement faster
combinatorial enumeration algorithms
http://code.google.com/p/sympy/issues/detail?id=3563
A few things I have thought of since my first post-
I was thinking I could have multiset_partitions_taocp() just take a list
(array)
