The solvers module in SymPy implements methods for solving equations.
Use solve() to solve algebraic equations. We suppose all equations are equaled to 0, so solving x**2 == 1 translates into the following code:
>>> from sympy.solvers import solve
>>> from sympy import Symbol
>>> x = Symbol('x')
>>> solve(x**2  1, x)
[1, 1]
The first argument for solve() is an equation (equaled to zero) and the second argument is the symbol that we want to solve the equation for.
Algebraically solves equations and systems of equations.
Input is formed as:
return list (perhaps empty) of solution mappings
return list of symbols and set of tuple(s) of solution(s)
don’t try to solve for any of the free symbols in exclude; if expressions are given, the free symbols in them will be extracted automatically.
If False, don’t do any testing of solutions. This can be useful if one wants to include solutions that make any denominator zero.
do a fast numerical check if f has only one symbol.
a very fast, minimal testing.
show a warning if checksol() could not conclude.
simplify all but cubic and quartic solutions before returning them and (if check is not False) use the general simplify function on the solutions and the expression obtained when they are substituted into the function which should be zero
make positive all symbols without assumptions regarding sign.
recast Floats as Rational; if this option is not used, the system containing floats may fail to solve because of issues with polys. If rational=None, Floats will be recast as rationals but the answer will be recast as Floats. If the flag is False then nothing will be done to the Floats.
do not use the polys/matrix method to solve a system of equations, solve them one at a time as you might “manually”.
allows solve to return a solution for a pattern in terms of other functions that contain that pattern; this is only needed if the pattern is inside of some invertible function like cos, exp, ....
instructs solve to try to find a particular solution to a linear system with as many zeros as possible; this is very expensive
when using particular=True, use a fast heuristic instead to find a solution with many zeros (instead of using the very slow method guaranteed to find the largest number of zeros possible)
Notes
assumptions aren’t checked when \(solve()\) input involves relationals or bools.
When the solutions are checked, those that make any denominator zero are automatically excluded. If you do not want to exclude such solutions then use the check=False option:
>>> from sympy import sin, limit
>>> solve(sin(x)/x) # 0 is excluded
[pi]
If check=False then a solution to the numerator being zero is found: x = 0. In this case, this is a spurious solution since sin(x)/x has the well known limit (without dicontinuity) of 1 at x = 0:
>>> solve(sin(x)/x, check=False)
[0, pi]
In the following case, however, the limit exists and is equal to the the value of x = 0 that is excluded when check=True:
>>> eq = x**2*(1/x  z**2/x)
>>> solve(eq, x)
[]
>>> solve(eq, x, check=False)
[0]
>>> limit(eq, x, 0, '')
0
>>> limit(eq, x, 0, '+')
0
Examples
The output varies according to the input and can be seen by example:
>>> from sympy import solve, Poly, Eq, Function, exp
>>> from sympy.abc import x, y, z, a, b
>>> f = Function('f')
boolean or univariate Relational
>>> solve(x < 3)
And(oo < re(x), im(x) == 0, re(x) < 3)
to always get a list of solution mappings, use flag dict=True
>>> solve(x  3, dict=True)
[{x: 3}]
>>> solve([x  3, y  1], dict=True)
[{x: 3, y: 1}]
to get a list of symbols and set of solution(s) use flag set=True
>>> solve([x**2  3, y  1], set=True)
([x, y], set([(sqrt(3), 1), (sqrt(3), 1)]))
single expression and single symbol that is in the expression
>>> solve(x  y, x)
[y]
>>> solve(x  3, x)
[3]
>>> solve(Eq(x, 3), x)
[3]
>>> solve(Poly(x  3), x)
[3]
>>> solve(x**2  y**2, x, set=True)
([x], set([(y,), (y,)]))
>>> solve(x**4  1, x, set=True)
([x], set([(1,), (1,), (I,), (I,)]))
single expression with no symbol that is in the expression
>>> solve(3, x)
[]
>>> solve(x  3, y)
[]
single expression with no symbol given
In this case, all free symbols will be selected as potential symbols to solve for. If the equation is univariate then a list of solutions is returned; otherwise – as is the case when symbols are given as an iterable of length > 1 – a list of mappings will be returned.
>>> solve(x  3) [3] >>> solve(x**2  y**2) [{x: y}, {x: y}] >>> solve(z**2*x**2  z**2*y**2) [{x: y}, {x: y}, {z: 0}] >>> solve(z**2*x  z**2*y**2) [{x: y**2}, {z: 0}]
when an object other than a Symbol is given as a symbol, it is isolated algebraically and an implicit solution may be obtained. This is mostly provided as a convenience to save one from replacing the object with a Symbol and solving for that Symbol. It will only work if the specified object can be replaced with a Symbol using the subs method.
>>> solve(f(x)  x, f(x)) [x] >>> solve(f(x).diff(x)  f(x)  x, f(x).diff(x)) [x + f(x)] >>> solve(f(x).diff(x)  f(x)  x, f(x)) [x + Derivative(f(x), x)] >>> solve(x + exp(x)**2, exp(x), set=True) ([exp(x)], set([(sqrt(x),), (sqrt(x),)]))>>> from sympy import Indexed, IndexedBase, Tuple, sqrt >>> A = IndexedBase('A') >>> eqs = Tuple(A[1] + A[2]  3, A[1]  A[2] + 1) >>> solve(eqs, eqs.atoms(Indexed)) {A[1]: 1, A[2]: 2}
To solve for a symbol implicitly, use ‘implicit=True’:
>>> solve(x + exp(x), x) [LambertW(1)] >>> solve(x + exp(x), x, implicit=True) [exp(x)]It is possible to solve for anything that can be targeted with subs:
>>> solve(x + 2 + sqrt(3), x + 2) [sqrt(3)] >>> solve((x + 2 + sqrt(3), x + 4 + y), y, x + 2) {y: 2 + sqrt(3), x + 2: sqrt(3)}Nothing heroic is done in this implicit solving so you may end up with a symbol still in the solution:
>>> eqs = (x*y + 3*y + sqrt(3), x + 4 + y) >>> solve(eqs, y, x + 2) {y: sqrt(3)/(x + 3), x + 2: (2*x  6 + sqrt(3))/(x + 3)} >>> solve(eqs, y*x, x) {x: y  4, x*y: 3*y  sqrt(3)}if you attempt to solve for a number remember that the number you have obtained does not necessarily mean that the value is equivalent to the expression obtained:
>>> solve(sqrt(2)  1, 1) [sqrt(2)] >>> solve(x  y + 1, 1) # /!\ 1 is targeted, too [x/(y  1)] >>> [_.subs(z, 1) for _ in solve((x  y + 1).subs(1, z), 1)] [x + y]To solve for a function within a derivative, use dsolve.
single expression and more than 1 symbol
when there is a linear solution
>>> solve(x  y**2, x, y) [{x: y**2}] >>> solve(x**2  y, x, y) [{y: x**2}]when undetermined coefficients are identified
that are linear
>>> solve((a + b)*x  b + 2, a, b) {a: 2, b: 2}that are nonlinear
>>> solve((a + b)*x  b**2 + 2, a, b, set=True) ([a, b], set([(sqrt(2), sqrt(2)), (sqrt(2), sqrt(2))]))if there is no linear solution then the first successful attempt for a nonlinear solution will be returned
>>> solve(x**2  y**2, x, y) [{x: y}, {x: y}] >>> solve(x**2  y**2/exp(x), x, y) [{x: 2*LambertW(y/2)}] >>> solve(x**2  y**2/exp(x), y, x) [{y: x*sqrt(exp(x))}, {y: x*sqrt(exp(x))}]
iterable of one or more of the above
involving relationals or bools
>>> solve([x < 3, x  2]) And(im(x) == 0, re(x) == 2) >>> solve([x > 3, x  2]) Falsewhen the system is linear
with a solution
>>> solve([x  3], x) {x: 3} >>> solve((x + 5*y  2, 3*x + 6*y  15), x, y) {x: 3, y: 1} >>> solve((x + 5*y  2, 3*x + 6*y  15), x, y, z) {x: 3, y: 1} >>> solve((x + 5*y  2, 3*x + 6*y  z), z, x, y) {x: 5*y + 2, z: 21*y  6}without a solution
>>> solve([x + 3, x  3]) []when the system is not linear
>>> solve([x**2 + y 2, y**2  4], x, y, set=True) ([x, y], set([(2, 2), (0, 2), (2, 2)]))if no symbols are given, all free symbols will be selected and a list of mappings returned
>>> solve([x  2, x**2 + y]) [{x: 2, y: 4}] >>> solve([x  2, x**2 + f(x)], set([f(x), x])) [{x: 2, f(x): 4}]if any equation doesn’t depend on the symbol(s) given it will be eliminated from the equation set and an answer may be given implicitly in terms of variables that were not of interest
>>> solve([x  y, y  3], x) {x: y}
Return a tuple derived from f = lhs  rhs that is either:
 (numerator, denominator) of f
If this comes back as (0, 1) it means that f is independent of the symbols in symbols, e.g:
y*cos(x)**2 + y*sin(x)**2  y = y*(0) = 0 cos(x)**2 + sin(x)**2 = 1If it comes back as (0, 0) there is no solution to the equation amongst the symbols given.
If the numerator is not zero then the function is guaranteed to be dependent on a symbol in symbols.
or
(symbol, solution) where symbol appears linearly in the numerator of f, is in symbols (if given) and is not in exclude (if given).
No simplification is done to f other than and mul=True expansion, so the solution will correspond strictly to a unique solution.
Examples
>>> from sympy.solvers.solvers import solve_linear
>>> from sympy.abc import x, y, z
These are linear in x and 1/x:
>>> solve_linear(x + y**2)
(x, y**2)
>>> solve_linear(1/x  y**2)
(x, y**(2))
When not linear in x or y then the numerator and denominator are returned.
>>> solve_linear(x**2/y**2  3)
(x**2  3*y**2, y**2)
If the numerator is a symbol then (0, 0) is returned if the solution for that symbol would have set any denominator to 0:
>>> solve_linear(1/(1/x  2))
(0, 0)
>>> 1/(1/x) # to SymPy, this looks like x ...
x
>>> solve_linear(1/(1/x)) # so a solution is given
(x, 0)
If x is allowed to cancel, then this appears linear, but this sort of cancellation is not done so the solution will always satisfy the original expression without causing a division by zero error.
>>> solve_linear(x**2*(1/x  z**2/x))
(x**2*(z**2 + 1), x)
You can give a list of what you prefer for x candidates:
>>> solve_linear(x + y + z, symbols=[y])
(y, x  z)
You can also indicate what variables you don’t want to consider:
>>> solve_linear(x + y + z, exclude=[x, z])
(y, x  z)
If only x was excluded then a solution for y or z might be obtained.
Solve system of N linear equations with M variables, which means both under and overdetermined systems are supported. The possible number of solutions is zero, one or infinite. Respectively, this procedure will return None or a dictionary with solutions. In the case of underdetermined systems, all arbitrary parameters are skipped. This may cause a situation in which an empty dictionary is returned. In that case, all symbols can be assigned arbitrary values.
Input to this functions is a Nx(M+1) matrix, which means it has to be in augmented form. If you prefer to enter N equations and M unknowns then use \(solve(Neqs, *Msymbols)\) instead. Note: a local copy of the matrix is made by this routine so the matrix that is passed will not be modified.
The algorithm used here is fractionfree Gaussian elimination, which results, after elimination, in an uppertriangular matrix. Then solutions are found using backsubstitution. This approach is more efficient and compact than the GaussJordan method.
>>> from sympy import Matrix, solve_linear_system
>>> from sympy.abc import x, y
Solve the following system:
x + 4 y == 2
2 x + y == 14
>>> system = Matrix(( (1, 4, 2), (2, 1, 14)))
>>> solve_linear_system(system, x, y)
{x: 6, y: 2}
A degenerate system returns an empty dictionary.
>>> system = Matrix(( (0,0,0), (0,0,0) ))
>>> solve_linear_system(system, x, y)
{}
Solves the augmented matrix system using LUsolve and returns a dictionary in which solutions are keyed to the symbols of syms as ordered.
The matrix must be invertible.
See also
sympy.matrices.LUsolve
Examples
>>> from sympy import Matrix
>>> from sympy.abc import x, y, z
>>> from sympy.solvers.solvers import solve_linear_system_LU
>>> solve_linear_system_LU(Matrix([
... [1, 2, 0, 1],
... [3, 2, 2, 1],
... [2, 0, 0, 1]]), [x, y, z])
{x: 1/2, y: 1/4, z: 1/2}
Solve equation of a type p(x; a_1, ..., a_k) == q(x) where both p, q are univariate polynomials and f depends on k parameters. The result of this functions is a dictionary with symbolic values of those parameters with respect to coefficients in q.
This functions accepts both Equations class instances and ordinary SymPy expressions. Specification of parameters and variable is obligatory for efficiency and simplicity reason.
>>> from sympy import Eq
>>> from sympy.abc import a, b, c, x
>>> from sympy.solvers import solve_undetermined_coeffs
>>> solve_undetermined_coeffs(Eq(2*a*x + a+b, x), [a, b], x)
{a: 1/2, b: 1/2}
>>> solve_undetermined_coeffs(Eq(a*c*x + a+b, x), [a, b], x)
{a: 1/c, b: 1/c}
Solve a nonlinear equation system numerically:
nsolve(f, [args,] x0, modules=['mpmath'], **kwargs)
f is a vector function of symbolic expressions representing the system. args are the variables. If there is only one variable, this argument can be omitted. x0 is a starting vector close to a solution.
Use the modules keyword to specify which modules should be used to evaluate the function and the Jacobian matrix. Make sure to use a module that supports matrices. For more information on the syntax, please see the docstring of lambdify.
Overdetermined systems are supported.
>>> from sympy import Symbol, nsolve
>>> import sympy
>>> sympy.mpmath.mp.dps = 15
>>> x1 = Symbol('x1')
>>> x2 = Symbol('x2')
>>> f1 = 3 * x1**2  2 * x2**2  1
>>> f2 = x1**2  2 * x1 + x2**2 + 2 * x2  8
>>> print(nsolve((f1, f2), (x1, x2), (1, 1)))
[1.19287309935246]
[ 1.27844411169911]
For onedimensional functions the syntax is simplified:
>>> from sympy import sin, nsolve
>>> from sympy.abc import x
>>> nsolve(sin(x), x, 2)
3.14159265358979
>>> nsolve(sin(x), 2)
3.14159265358979
mpmath.findroot is used, you can find there more extensive documentation, especially concerning keyword parameters and available solvers.
Checks whether expression \(expr\) satisfies all assumptions.
\(assumptions\) is a dict of assumptions: {‘assumption’: TrueFalse, ...}.
Examples
>>> from sympy import Symbol, pi, I, exp
>>> from sympy.solvers.solvers import check_assumptions
>>> check_assumptions(5, integer=True)
True
>>> check_assumptions(pi, real=True, integer=False)
True
>>> check_assumptions(pi, real=True, negative=True)
False
>>> check_assumptions(exp(I*pi/7), real=False)
True
>>> x = Symbol('x', real=True, positive=True)
>>> check_assumptions(2*x + 1, real=True, positive=True)
True
>>> check_assumptions(2*x  5, real=True, positive=True)
False
\(None\) is returned if check_assumptions() could not conclude.
>>> check_assumptions(2*x  1, real=True, positive=True)
>>> z = Symbol('z')
>>> check_assumptions(z, real=True)
Checks whether sol is a solution of equation f == 0.
Input can be either a single symbol and corresponding value or a dictionary of symbols and values. When given as a dictionary and flag simplify=True, the values in the dictionary will be simplified. f can be a single equation or an iterable of equations. A solution must satisfy all equations in f to be considered valid; if a solution does not satisfy any equation, False is returned; if one or more checks are inconclusive (and none are False) then None is returned.
Examples
>>> from sympy import symbols
>>> from sympy.solvers import checksol
>>> x, y = symbols('x,y')
>>> checksol(x**4  1, x, 1)
True
>>> checksol(x**4  1, x, 0)
False
>>> checksol(x**2 + y**2  5**2, {x: 3, y: 4})
True
To check if an expression is zero using checksol, pass it as f and send an empty dictionary for symbol:
>>> checksol(x**2 + x  x*(x + 1), {})
True
None is returned if checksol() could not conclude.
Returns the order of a given differential equation with respect to func.
This function is implemented recursively.
Examples
>>> from sympy import Function
>>> from sympy.solvers.deutils import ode_order
>>> from sympy.abc import x
>>> f, g = map(Function, ['f', 'g'])
>>> ode_order(f(x).diff(x, 2) + f(x).diff(x)**2 +
... f(x).diff(x), f(x))
2
>>> ode_order(f(x).diff(x, 2) + g(x).diff(x, 3), f(x))
2
>>> ode_order(f(x).diff(x, 2) + g(x).diff(x, 3), g(x))
3
Solve univariate recurrence with rational coefficients.
Given \(k\)th order linear recurrence \(\operatorname{L} y = f\), or equivalently:
where \(a_{i}(n)\), for \(i=0, \dots, k\), are polynomials or rational functions in \(n\), and \(f\) is a hypergeometric function or a sum of a fixed number of pairwise dissimilar hypergeometric terms in \(n\), finds all solutions or returns None, if none were found.
Initial conditions can be given as a dictionary in two forms:
 { n_0 : v_0, n_1 : v_1, ..., n_m : v_m }
 { y(n_0) : v_0, y(n_1) : v_1, ..., y(n_m) : v_m }
or as a list L of values:
L = [ v_0, v_1, ..., v_m ]
where L[i] = v_i, for \(i=0, \dots, m\), maps to \(y(n_i)\).
See also
Examples
Lets consider the following recurrence:
>>> from sympy import Function, rsolve
>>> from sympy.abc import n
>>> y = Function('y')
>>> f = (n  1)*y(n + 2)  (n**2 + 3*n  2)*y(n + 1) + 2*n*(n + 1)*y(n)
>>> rsolve(f, y(n))
2**n*C0 + C1*factorial(n)
>>> rsolve(f, y(n), { y(0):0, y(1):3 })
3*2**n  3*factorial(n)
Given linear recurrence operator \(\operatorname{L}\) of order \(k\) with polynomial coefficients and inhomogeneous equation \(\operatorname{L} y = f\), where \(f\) is a polynomial, we seek for all polynomial solutions over field \(K\) of characteristic zero.
The algorithm performs two basic steps:
 Compute degree \(N\) of the general polynomial solution.
 Find all polynomials of degree \(N\) or less of \(\operatorname{L} y = f\).
There are two methods for computing the polynomial solutions. If the degree bound is relatively small, i.e. it’s smaller than or equal to the order of the recurrence, then naive method of undetermined coefficients is being used. This gives system of algebraic equations with \(N+1\) unknowns.
In the other case, the algorithm performs transformation of the initial equation to an equivalent one, for which the system of algebraic equations has only \(r\) indeterminates. This method is quite sophisticated (in comparison with the naive one) and was invented together by Abramov, Bronstein and Petkovsek.
It is possible to generalize the algorithm implemented here to the case of linear qdifference and differential equations.
Lets say that we would like to compute \(m\)th Bernoulli polynomial up to a constant. For this we can use \(b(n+1)  b(n) = m n^{m1}\) recurrence, which has solution \(b(n) = B_m + C\). For example:
>>> from sympy import Symbol, rsolve_poly
>>> n = Symbol('n', integer=True)
>>> rsolve_poly([1, 1], 4*n**3, n)
C0 + n**4  2*n**3 + n**2
References
[R376]  S. A. Abramov, M. Bronstein and M. Petkovsek, On polynomial solutions of linear operator equations, in: T. Levelt, ed., Proc. ISSAC ‘95, ACM Press, New York, 1995, 290296. 
[R377]  M. Petkovsek, Hypergeometric solutions of linear recurrences with polynomial coefficients, J. Symbolic Computation, 14 (1992), 243264. 
[R378] 

Given linear recurrence operator \(\operatorname{L}\) of order \(k\) with polynomial coefficients and inhomogeneous equation \(\operatorname{L} y = f\), where \(f\) is a polynomial, we seek for all rational solutions over field \(K\) of characteristic zero.
This procedure accepts only polynomials, however if you are interested in solving recurrence with rational coefficients then use rsolve which will preprocess the given equation and run this procedure with polynomial arguments.
The algorithm performs two basic steps:
 Compute polynomial \(v(n)\) which can be used as universal denominator of any rational solution of equation \(\operatorname{L} y = f\).
 Construct new linear difference equation by substitution \(y(n) = u(n)/v(n)\) and solve it for \(u(n)\) finding all its polynomial solutions. Return None if none were found.
Algorithm implemented here is a revised version of the original Abramov’s algorithm, developed in 1989. The new approach is much simpler to implement and has better overall efficiency. This method can be easily adapted to qdifference equations case.
Besides finding rational solutions alone, this functions is an important part of Hyper algorithm were it is used to find particular solution of inhomogeneous part of a recurrence.
See also
References
[R379]  S. A. Abramov, Rational solutions of linear difference and qdifference equations with polynomial coefficients, in: T. Levelt, ed., Proc. ISSAC ‘95, ACM Press, New York, 1995, 285289 
Examples
>>> from sympy.abc import x
>>> from sympy.solvers.recurr import rsolve_ratio
>>> rsolve_ratio([2*x**3 + x**2 + 2*x  1, 2*x**3 + x**2  6*x,
...  2*x**3  11*x**2  18*x  9, 2*x**3 + 13*x**2 + 22*x + 8], 0, x)
C2*(2*x  3)/(2*(x**2  1))
Given linear recurrence operator \(\operatorname{L}\) of order \(k\) with polynomial coefficients and inhomogeneous equation \(\operatorname{L} y = f\) we seek for all hypergeometric solutions over field \(K\) of characteristic zero.
The inhomogeneous part can be either hypergeometric or a sum of a fixed number of pairwise dissimilar hypergeometric terms.
The algorithm performs three basic steps:
 Group together similar hypergeometric terms in the inhomogeneous part of \(\operatorname{L} y = f\), and find particular solution using Abramov’s algorithm.
 Compute generating set of \(\operatorname{L}\) and find basis in it, so that all solutions are linearly independent.
 Form final solution with the number of arbitrary constants equal to dimension of basis of \(\operatorname{L}\).
Term \(a(n)\) is hypergeometric if it is annihilated by first order linear difference equations with polynomial coefficients or, in simpler words, if consecutive term ratio is a rational function.
The output of this procedure is a linear combination of fixed number of hypergeometric terms. However the underlying method can generate larger class of solutions  D’Alembertian terms.
Note also that this method not only computes the kernel of the inhomogeneous equation, but also reduces in to a basis so that solutions generated by this procedure are linearly independent
References
[R380]  M. Petkovsek, Hypergeometric solutions of linear recurrences with polynomial coefficients, J. Symbolic Computation, 14 (1992), 243264. 
[R381] 

Examples
>>> from sympy.solvers import rsolve_hyper
>>> from sympy.abc import x
>>> rsolve_hyper([1, 1, 1], 0, x)
C0*(1/2 + sqrt(5)/2)**x + C1*(sqrt(5)/2 + 1/2)**x
>>> rsolve_hyper([1, 1], 1 + x, x)
C0 + x*(x + 1)/2
Solve a system of polynomial equations.
Examples
>>> from sympy import solve_poly_system
>>> from sympy.abc import x, y
>>> solve_poly_system([x*y  2*y, 2*y**2  x**2], x, y)
[(0, 0), (2, sqrt(2)), (2, sqrt(2))]
Solve a polynomial system using GianniKalkbrenner algorithm.
The algorithm proceeds by computing one Groebner basis in the ground domain and then by iteratively computing polynomial factorizations in appropriately constructed algebraic extensions of the ground domain.
References
1. Patrizia Gianni, Teo Mora, Algebraic Solution of System of Polynomial Equations using Groebner Bases, AAECC5 on Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes, LNCS 356 247–257, 1989
Examples
>>> from sympy.solvers.polysys import solve_triangulated
>>> from sympy.abc import x, y, z
>>> F = [x**2 + y + z  1, x + y**2 + z  1, x + y + z**2  1]
>>> solve_triangulated(F, x, y, z)
[(0, 0, 1), (0, 1, 0), (1, 0, 0)]
See Diophantine