Status: New
Owner: plaes800
Labels: Type-Defect Priority-Medium
New issue 1498 by plaes800: Implement symbolic lcm, gcd
http://code.google.com/p/sympy/issues/detail?id=1498
There is currently no symbolic lcm (least common multiplier) and gcd
(greatest common divisor).
--
You received this mes
Comment #1 on issue 1497 by asmeurer: (x+y)/-z does not automatically
expand to (-x - y)/z
http://code.google.com/p/sympy/issues/detail?id=1497
This is another part of this that I did not consider and I do not think my
patch addresses:
>>> print -((x+y)/z)
-(x + y)/z
--
You received this m
Updates:
Status: Accepted
Comment #2 on issue 1497 by ondrej.certik: (x+y)/-z does not automatically
expand to (-x - y)/z
http://code.google.com/p/sympy/issues/detail?id=1497
I think the minus should be working.
The patch seems to be the correct fix for this. The tests should be
exa
Comment #1 on issue 1498 by asmeurer: Implement symbolic lcm, gcd
http://code.google.com/p/sympy/issues/detail?id=1498
Could you give more specific examples of what such functions would return?
And does together() do either of
these?
--
You received this message because you are listed in the
Comment #9 on issue 1493 by ryanlists: factor a minus 1 out of fractions in
simplify
http://code.google.com/p/sympy/issues/detail?id=1493
So, I think I fixed this. test_solvers.py has been modified and all tests
pass.
There is a new branch in my repo:
git://github.com/ryanGT/sympy.git
calle
Comment #2 on issue 1498 by plaes800: Implement symbolic lcm, gcd
http://code.google.com/p/sympy/issues/detail?id=1498
gcd - greatest common divisor:
>>> gcd(x**2, x, x**3)
x
>>> gcd(x**2, x**4, x**3)
x**2
>>> gcd(x, y, 3)
1
>>> gcd(4, 6, 12) # Regular numbers
4
lcd - least common multiple
>>>
Comment #3 on issue 1497 by ronan.l...@gmail.com: (x+y)/-z does not
automatically expand to (-x - y)/z
http://code.google.com/p/sympy/issues/detail?id=1497
This code is ugly! There shouldn't be more special cases but less. With
this patch,
we still get:
In [6]: -(x+y)*(x/z) == (x+y)*(-x/z)
Comment #3 on issue 1498 by ronan.l...@gmail.com: Implement symbolic lcm,
gcd
http://code.google.com/p/sympy/issues/detail?id=1498
I think what you are looking for is this:
In [20]: gcd(y*(1+x)**2, (1-x**2)*y,x,y)
Out[20]: y + x⋅y
It's not very well documented, but it's there.
--
You receive
Comment #4 on issue 1497 by ronan.l...@gmail.com: (x+y)/-z does not
automatically expand to (-x - y)/z
http://code.google.com/p/sympy/issues/detail?id=1497
I wrote the previous comment too quickly and it came out as much more
agressive than
I intended. To clarify, I think that having Mul dis
Comment #5 on issue 1497 by asmeurer: (x+y)/-z does not automatically
expand to (-x - y)/z
http://code.google.com/p/sympy/issues/detail?id=1497
I generally agree with what you are saying. Checking each possible
combination that we want to distribute can get ugly, though
note that things wil
Updates:
Labels: -NeedsReview
Comment #26 on issue 1306 by fab...@fseoane.net: Test the rst docs
http://code.google.com/p/sympy/issues/detail?id=1306
(No comment was entered for this change.)
--
You received this message because you are listed in the owner
or CC fields of this issue, or
11 matches
Mail list logo