Oscar Benjamin

I've just merged gh-27353 so `symbols(..., seq=True)` should now return a type that is understood by a type checker.

Many of the test failures are similar to this failed doctest: ```python File "/home/runner/work/sympy/sympy/doc/src/explanation/solve_output.rst", line 101, in solve_output.rst Failed example: sol = solve(system[:2]); sol Expected: [{x: -1, y: z +...

From https://github.com/sympy/sympy/issues/27008#issuecomment-2395857807 > My code's output is: > > `[{Rf: Ri*(C*R*s + 1)**2/(C*R*s), Ri: Ri, V1: Vplus*(2*C*R*s + 1)/(C*R*s), Vminus: Vplus, Vout: Vplus*(C**2*R**2*s**2 + 3*C*R*s + 1)/(C*R*s), Vplus: Vplus}]` The...

> Notice that the first polynomial factorises giving us two cases See the discussion here https://github.com/sympy/sympy/pull/27020#issuecomment-2320839424 We can't apply the back substitution method before getting to the point of having...

The problem with the approach taken here is that it still ultimately depends on calling `solve_poly_system` but `solve_poly_system` really needs to be rewritten. We basically need all new code for...

> It also suffered a timeout on solving a certain system in the slow tests during the CI build. > > ```python > @slow > def test_issue_12114(): > a, b,...

I think that there should also be a function that just computes the irreducible Groebner bases and removes any redundant systems but does not attempt to solve them. Often that...

> Is this somewhat closer to the desired solution ? Yes, I think so. I think that there is more to work out though for each function like exactly what...

I think it is best to make a new pull request only for the `factor_poly_system` function which should be called `factor_system` I think. We can have a pull request for...

I'm marking this as draft since it is on hold now in favour of gh-27169.