Comment #2 on issue 3821 by smi...@gmail.com: trigsimp does not simplify
`cosh(z) - sinh(z)`
http://code.google.com/p/sympy/issues/detail?id=3821
trigsimp tries to work with trig functions, not exponentials.
foo.rewrite(exp) will give the desired result for all of these:
for foo in
[cos
Comment #2 on issue 3826 by smi...@gmail.com: trigsimp can't reverse tan
double angle formula
http://code.google.com/p/sympy/issues/detail?id=3826
If something fails in trigsimp try the more robust fu.
fu(tan(2*x).expand(trig=1))
tan(2*x)
--
You received this message because this project
Comment #21 on issue 1198 by asmeu...@gmail.com: pickle does not work for
Function
http://code.google.com/p/sympy/issues/detail?id=1198
Of course, the easiest way is if we just release. Anyone want to help?
--
You received this message because this project is configured to send all
issue n
Status: Valid
Owner:
Labels: Type-Defect Priority-Medium Live Documentation
New issue 3830 by asmeu...@gmail.com: SymPy Live settings should start
closed in the Sphinx extension
http://code.google.com/p/sympy/issues/detail?id=3830
When the SymPy Live console in the Sphinx extension opens
Comment #20 on issue 1198 by asmeu...@gmail.com: pickle does not work for
Function
http://code.google.com/p/sympy/issues/detail?id=1198
My question is, what's the best way (short of releasing) to backport this
to SymPy Live?
--
You received this message because this project is configured
Comment #19 on issue 1198 by li.david...@gmail.com: pickle does not work
for Function
http://code.google.com/p/sympy/issues/detail?id=1198
I think this fix is fine, but hopefully we can make pickling work better
overall.
--
You received this message because this project is configured to s
Updates:
Status: Fixed
Comment #8 on issue 3769 by asmeu...@gmail.com: minpoly hangs on this
expresion; should subtract constant?
http://code.google.com/p/sympy/issues/detail?id=3769
(No comment was entered for this change.)
--
You received this message because this project is config
Updates:
Labels: Simplify
Comment #1 on issue 3812 by asmeu...@gmail.com: simplify() is wrong
http://code.google.com/p/sympy/issues/detail?id=3812
Possibly related to issue 3825.
--
You received this message because this project is configured to send all
issue notifications to this ad
Status: NeedsDecision
Owner:
Labels: Type-Defect Priority-Medium Integration
New issue 3829 by asmeu...@gmail.com: Should Integral.subs (and
Subs(Integral)) on an indefinite integral return an integral with two limits
http://code.google.com/p/sympy/issues/detail?id=3829
This is related t
Updates:
Status: Fixed
Comment #4 on issue 3827 by asmeu...@gmail.com: integrate(sqrt(x**2/((y -
x)*(y + x))), x) showing some infinities
http://code.google.com/p/sympy/issues/detail?id=3827
(No comment was entered for this change.)
--
You received this message because this project i
Comment #2 on issue 3828 by asmeu...@gmail.com: Report versions of all
external modules in test
http://code.google.com/p/sympy/issues/detail?id=3828
Another plus to this idea is that import_module already has flags to deal
with different ways of module reporting their own version.
--
You
Updates:
Status: Valid
Comment #1 on issue 3828 by asmeu...@gmail.com: Report versions of all
external modules in test
http://code.google.com/p/sympy/issues/detail?id=3828
Is there some way to use import_module or doctest_depends_on to
automatically gather all external modules that
Comment #27 on issue 3809 by asmeu...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
Any one care to compare timings for
http://en.literateprograms.org/index.php?title=Special:DownloadCode/Miller-Rabin_primality_test_(Python)&oldid=17104)
to SymPy with
Comment #26 on issue 3809 by asmeu...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
By the way, the b**2 % 2 thing actually doesn't matter. b is already
reduced mod n from the previous line, so using pow shouldn't make any
difference, especially since
Comment #25 on issue 3809 by asmeu...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
You misunderstood my question. I'm not talking about the witnesses. I'm
talking about the inputs to isprime. You keep talking about testing it
against some large Mersen
Comment #18 on issue 1198 by asmeu...@gmail.com: pickle does not work for
Function
http://code.google.com/p/sympy/issues/detail?id=1198
I went ahead and submitted the fix from comment 13 at
https://github.com/sympy/sympy/pull/2114. It will fix SymPy live the next
time we release.
--
Yo
Issue 1688: Functions should be objects
http://code.google.com/p/sympy/issues/detail?id=1688
This issue is now blocking issue sympy:1198.
See http://code.google.com/p/sympy/issues/detail?id=1198
--
You received this message because you are listed in the owner
or CC fields of this issue, or becau
Updates:
Blockedon: sympy:1688
Comment #17 on issue 1198 by asmeu...@gmail.com: pickle does not work for
Function
http://code.google.com/p/sympy/issues/detail?id=1198
(No comment was entered for this change.)
--
You received this message because this project is configured to send all
Comment #24 on issue 3809 by prasoon9...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
And just to be clear, we don't need to test against composites *also*.
Primes themselves are good enough.
We are using any numbers between 2 and n-2 as witnesses to
Comment #23 on issue 3809 by prasoon9...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
Well, AFAIK, for the cases in the _mr_safe function (that is for if n <
1), we can just test for certain primes and know _for sure_
whether n is pri
Comment #22 on issue 3809 by asmeu...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
Do primes represent the worst case scenario in this algorithm. Should we
also test against composites?
--
You received this message because this project is configured t
Comment #21 on issue 3809 by prasoon9...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
Btw, I ran a python script that uses the MR algorithm (found here :
http://en.literateprograms.org/index.php?title=Special:DownloadCode/Miller-Rabin_primality_test_(Py
Comment #20 on issue 3809 by prasoon9...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
Well, I suppose we can just test out with large primes (Mersenne primes
maybe) for that. As I wrote before, on my workstation, it took the same
time with either way.
Comment #19 on issue 3809 by asmeu...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
Oh of course. It will indeed be much faster with pow because it computes
the mod before squaring.
But is that the source of the slowdown here?
--
You received this mes
Updates:
Status: Fixed
Comment #18 on issue 3715 by asmeu...@gmail.com: ufuncify with logarithms
http://code.google.com/p/sympy/issues/detail?id=3715
(No comment was entered for this change.)
--
You received this message because this project is configured to send all
issue notificatio
Comment #1 on issue 3826 by smi...@gmail.com: trigsimp can't reverse tan
double angle formula
http://code.google.com/p/sympy/issues/detail?id=3826
a workaround is
from sympy.simplify.fu import *
eq
2*tan(x)/(-tan(x)**2 + 1)
simplify(TR2(eq))
tan(2*x)
--
You received this message becaus
Comment #18 on issue 3809 by smi...@gmail.com: isprime can be faster
http://code.google.com/p/sympy/issues/detail?id=3809
See the tests above...a 262k digit base being squared either takes
about .002 seconds with pow or 10,000x longer with **
--
You received this message because this project
Status: New
Owner:
Labels: Type-Enhancement Priority-Medium Testing
New issue 3828 by hacm...@gmail.com: Report versions of all external
modules in test
http://code.google.com/p/sympy/issues/detail?id=3828
Currently, SymPy reports the version of Python and gmpy when running tests.
It s
Comment #5 on issue 3647 by julien.r...@gmail.com: Require explicit
assumptions when integrating with manualintegrate.
http://code.google.com/p/sympy/issues/detail?id=3647
from sympy import integrate, sqrt
from sympy.abc import x, y
integrate(1/((y - x)*(y + x)), x)
-(log(x - y)/2 - log(x +
Updates:
Status: Started
Owner: julien.r...@gmail.com
Comment #3 on issue 3827 by julien.r...@gmail.com: integrate(sqrt(x**2/((y
- x)*(y + x))), x) showing some infinities
http://code.google.com/p/sympy/issues/detail?id=3827
https://github.com/sympy/sympy/pull/2112
--
You rec
Comment #2 on issue 3827 by julien.r...@gmail.com: integrate(sqrt(x**2/((y
- x)*(y + x))), x) showing some infinities
http://code.google.com/p/sympy/issues/detail?id=3827
I think the bug is in heurisch_wrapper(). For the time being you can use
integrate(sqrt(x**2/((y - x)*(y + x))), x, cond
Comment #12 on issue 1592 by asmeu...@gmail.com: Pretty print Sum with a
Sigma
http://code.google.com/p/sympy/issues/detail?id=1592
Yeah, but that's a single character. Somehow
n2
Σ i
i = 0
doesn't look that good to me.
--
You received this message because this project is configu
32 matches
Mail list logo
