Comment #18 on issue 2128 by asmeurer: Implement more general piecewise
integration algorithm
http://code.google.com/p/sympy/issues/detail?id=2128
Yes, those wiki pages are where I would have referred you to. The best
thing to do would be to create an account on GitHub and then to fork
Updates:
Labels: Integration
Comment #2 on issue 1696 by asmeurer: integral of heaviside
http://code.google.com/p/sympy/issues/detail?id=1696
The problem is the same as in issue 1113. diff(Heaviside(x), x) gives
DiracDelta(x), and integrate() doesn't know how to handle that (rewrite
Updates:
Status: Started
Owner: mattpap
Labels: -NeedsBetterPatch NeedsReview Milestone-Release0.7.0
Comment #9 on issue 1801 by mattpap: igcd and ilcm could handle rationals
http://code.google.com/p/sympy/issues/detail?id=1801
btw2. It is now also possible to use gcd()
Comment #11 on issue 1949 by mattpap: Doctests for polynomials module
http://code.google.com/p/sympy/issues/detail?id=1949
This issue is not related strictly to ground types, but a bit was said
about this here, so lets summarize recent changes in polys11 related to
ground types.
Comment #12 on issue 1949 by asmeurer: Doctests for polynomials module
http://code.google.com/p/sympy/issues/detail?id=1949
Nice. I think this will simplify things, not having to worry about
Fraction or sympy ground types. How were you able to make PythonFraction
faster than Fraction? I
Comment #13 on issue 1949 by mattpap: Doctests for polynomials module
http://code.google.com/p/sympy/issues/detail?id=1949
How were you able to make PythonFraction faster than Fraction?
Fraction is implemented in pure Python using ABCs and is very, very
generic, so it's not that hard to
Comment #24 on issue 694 by mattpap: Add tests from Review of CAS
mathematical capabilities, by Michael Wester
http://code.google.com/p/sympy/issues/detail?id=694
Regarding #21, now (polys11) those solutions also simplify to zero:
In [1]: f = x**4+x**3+x**2+x+1
In [2]: s = solve(f, x)
In