Comment #4 on issue 3791 by asmeu...@gmail.com: AttributeError: 'Mul'
object attribute 'is_commutative' is read-only, when a try to do
sympy.integrate()
http://code.google.com/p/sympy/issues/detail?id=3791
Then again, maybe it isn't wrong. The line in power.py is run all the time,
and it
Updates:
Status: Valid
Labels: NonCommutative Core
Comment #3 on issue 3791 by asmeu...@gmail.com: AttributeError: 'Mul'
object attribute 'is_commutative' is read-only, when a try to do
sympy.integrate()
http://code.google.com/p/sympy/issues/detail?id=3791
That's not right e
Updates:
Labels: Assumptions
Comment #7 on issue 3699 by asmeu...@gmail.com: solve() should be able to
tell you when it knows it's found all the solutions
http://code.google.com/p/sympy/issues/detail?id=3699
This is also tied to assumptions, at least in the implementation. For
examp
Comment #4 on issue 3722 by asmeu...@gmail.com: solve can try split
equation into real and imaginary parts
http://code.google.com/p/sympy/issues/detail?id=3722
Some interesting generalizations of this were suggested on the mailing list:
solve([re(x) - 1, im(x) - 2], x)
solve([abs(x) - 2, arg
Comment #15 on issue 3809 by asmeu...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
It's not mod n. n**2 % n is always 0.
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust yo
Comment #14 on issue 3809 by smi...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
btw, the difference between n**2 % n and pow(n,2,n) can be pretty dramatic:
p=1
while 1:
... n=int((10**p))
... t=time();j=n**2 % n;print time()-t,p
... p*=2
...
0.0 1
0.0
Updates:
Status: Fixed
Comment #2 on issue 3818 by smi...@gmail.com: Undefined name _clear in
sympify.py
http://code.google.com/p/sympy/issues/detail?id=3818
(No comment was entered for this change.)
--
You received this message because this project is configured to send all
issue
Comment #13 on issue 3809 by smi...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
the mr routine raises the bases to a large power mod n. The larger the
power the longer this takes. Since the number in question here has about
16000 digits we won't expe
