Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Equation solving
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Finding values for variables that make an equation true}} {{one source|date=December 2009}} {{redirect|Solution (mathematics)|solutions of constraint satisfaction problems|Constraint satisfaction problem#Resolution|solutions of mathematical optimization problems|Feasible solution}} {{Image frame|width=220|align=right|caption=The [[quadratic formula]], the symbolic solution of the [[quadratic equation]] {{math|1=''ax''<sup>2</sup> + ''bx'' + ''c'' = 0}} |content=<math>\overset{}{\underset{}{ x=\frac{-b\pm\sqrt{b^2-4ac} }{2a} } }</math>}} [[Image:NewtonIteration Ani.gif|alt=Illustration of Newton's method|thumb|An example of using [[Newton–Raphson method]] to solve numerically the equation {{math|1=''f''(''x'') = 0}}]] In [[mathematics]], to '''solve an equation''' is to find its '''solutions''', which are the values ([[number]]s, [[function (mathematics)|functions]], [[Set (mathematics)|sets]], etc.) that fulfill the condition stated by the [[equation]], consisting generally of two [[expression (mathematics)|expression]]s related by an [[equals sign]]. When seeking a solution, one or more [[variable (mathematics)|variable]]s are designated as ''[[Indeterminate (variable)|unknowns]]''. A solution is an assignment of values to the unknown variables that makes the equality in the equation true. In other words, a solution is a value or a collection of values (one for each unknown) such that, when [[Substitution (algebra)|substituted]] for the unknowns, the equation becomes an [[equality (mathematics)|equality]]. A solution of an equation is often called a '''root''' of the equation, particularly but not only for [[polynomial equation]]s. The set of all solutions of an equation is its [[solution set]]. An equation may be solved either [[Numerical mathematics|numerically]] or symbolically. Solving an equation ''numerically'' means that only numbers are admitted as solutions. Solving an equation ''symbolically'' means that expressions can be used for representing the solutions. For example, the equation {{math|1=''x'' + ''y'' = 2''x'' – 1}} is solved for the unknown {{mvar|x}} by the expression {{math|1=''x'' = ''y'' + 1}}, because substituting {{math|''y'' + 1}} for {{math|''x''}} in the equation results in {{math|1=(''y'' + 1) + ''y'' = 2(''y'' + 1) – 1}}, a true statement. It is also possible to take the variable {{math|''y''}} to be the unknown, and then the equation is solved by {{math|1=''y'' = ''x'' – 1}}. Or {{math|''x''}} and {{math|''y''}} can both be treated as unknowns, and then there are many solutions to the equation; a symbolic solution is {{math|1=(''x'', ''y'') = (''a'' + 1, ''a'')}}, where the variable {{mvar|a}} may take any value. Instantiating a symbolic solution with specific numbers gives a numerical solution; for example, {{math|1=''a'' = 0}} gives {{math|1=(''x'', ''y'') = (1, 0)}} (that is, {{math|1=''x'' = 1, ''y'' = 0}}), and {{math|1=''a'' = 1}} gives {{math|1=(''x'', ''y'') = (2, 1)}}. The distinction between known variables and unknown variables is generally made in the statement of the problem, by phrases such as "an equation ''in'' {{mvar|x}} and {{mvar|y}}", or "solve ''for'' {{math|''x''}} and {{math|''y''}}", which indicate the unknowns, here {{math|''x''}} and {{math|''y''}}. However, it is common to reserve {{mvar|x}}, {{mvar|y}}, {{mvar|z}}, ... to denote the unknowns, and to use {{mvar|a}}, {{mvar|b}}, {{mvar|c}}, ... to denote the known variables, which are often called [[parameter]]s. This is typically the case when considering [[polynomial equation]]s, such as [[quadratic equation]]s. However, for some problems, all variables may assume either role. Depending on the context, solving an equation may consist to find either any solution (finding a single solution is enough), all solutions, or a solution that satisfies further properties, such as belonging to a given [[interval (mathematics)|interval]]. When the task is to find the solution that is the ''best'' under some criterion, this is an [[optimization problem]]. Solving an optimization problem is generally not referred to as "equation solving", as, generally, solving methods start from a particular solution for finding a better solution, and repeating the process until finding eventually the best solution. ==Overview== One general form of an equation is :<math>f\left(x_1,\dots,x_n\right)=c,</math> where {{mvar|f}} is a [[function (mathematics)|function]], {{math|''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub>}} are the unknowns, and {{math|''c''}} is a constant. Its solutions are the elements of the [[inverse image]] ([[Fiber (mathematics)|fiber]]) :<math>f^{-1}(c)=\bigl\{(a_1,\dots,a_n)\in D\mid f\left(a_1,\dots,a_n\right)=c\bigr\},</math> where {{math|''D''}} is the [[Domain of a function|domain]] of the function {{mvar|f}}. The set of solutions can be the [[empty set]] (there are no solutions), a [[singleton (mathematics)|singleton]] (there is exactly one solution), finite, or infinite (there are infinitely many solutions). For example, an equation such as :<math>3x+2y=21z,</math> with unknowns {{math|''x'', ''y''}} and {{math|''z''}}, can be put in the above form by subtracting {{math|21''z''}} from both sides of the equation, to obtain :<math>3x+2y-21z=0</math> In this particular case there is not just ''one'' solution, but an infinite set of solutions, which can be written using [[set builder notation]] as :<math>\bigl\{(x,y,z)\mid 3x+2y-21z=0\bigr\}.</math> One particular solution is {{math|1=''x'' = 0, ''y'' = 0, ''z'' = 0}}. Two other solutions are {{math|1=''x'' = 3, ''y'' = 6, ''z'' = 1}}, and {{math|1=''x'' = 8, ''y'' = 9, ''z'' = 2}}. There is a unique [[plane (geometry)|plane]] in [[three-dimensional space]] which passes through the three points with these [[coordinates]], and this plane is the set of all points whose coordinates are solutions of the equation. ==Solution sets== [[File:Ellipse in coordinate system with semi-axes labelled.svg|thumb|The solution set of the equation {{math|1={{sfrac|''x''<sup>2</sup>|4}} + ''y''<sup>2</sup> = 1}} forms an [[ellipse]] when interpreted as a set of [[Cartesian coordinate]] pairs.]] {{Main|Solution set}} The [[solution set]] of a given set of equations or [[inequality (mathematics)|inequalities]] is the [[set (mathematics)|set]] of all its solutions, a solution being a [[tuple]] of values, one for each [[unknown (mathematics)|unknown]], that satisfies all the equations or inequalities. If the [[solution set]] is empty, then there are no values of the unknowns that satisfy simultaneously all equations and inequalities. For a simple example, consider the equation :<math>x^2=2.</math> This equation can be viewed as a [[Diophantine equation]], that is, an equation for which only [[integer]] solutions are sought. In this case, the solution set is the [[empty set]], since 2 is not the [[square (algebra)|square]] of an integer. However, if one searches for [[real number|real]] solutions, there are two solutions, {{math|{{radic|2}}}} and {{math|–{{radic|2}}}}; in other words, the solution set is {{math|{{mset|{{radic|2}}, −{{radic|2}}}}}}. When an equation contains several unknowns, and when one has several equations with more unknowns than equations, the solution set is often infinite. In this case, the solutions cannot be listed. For representing them, a [[parametrization (geometry)|parametrization]] is often useful, which consists of expressing the solutions in terms of some of the unknowns or auxiliary variables. This is always possible when all the equations are [[linear equation|linear]]. Such infinite solution sets can naturally be interpreted as [[geometry|geometric]] shapes such as [[line (geometry)|lines]], [[curve (geometry)|curves]] (see picture), [[plane (geometry)|planes]], and more generally [[algebraic variety|algebraic varieties]] or [[manifold]]s. In particular, [[algebraic geometry]] may be viewed as the study of solution sets of [[algebraic equation]]s. == Methods of solution == The methods for solving equations generally depend on the type of equation, both the kind of expressions in the equation and the kind of values that may be assumed by the unknowns. The variety in types of equations is large, and so are the corresponding methods. Only a few specific types are mentioned below. In general, given a class of equations, there may be no known systematic method ([[algorithm]]) that is guaranteed to work. This may be due to a lack of mathematical knowledge; some problems were only solved after centuries of effort. But this also reflects that, in general, no such method can exist: some problems are known to be [[Unsolvable problem|unsolvable]] by an algorithm, such as [[Hilbert's tenth problem]], which was proved unsolvable in 1970. For several classes of equations, algorithms have been found for solving them, some of which have been implemented and incorporated in [[computer algebra system]]s, but often require no more sophisticated technology than pencil and paper. In some other cases, [[heuristic]] methods are known that are often successful but that are not guaranteed to lead to success. ===Brute force, trial and error, inspired guess=== If the solution set of an equation is restricted to a finite set (as is the case for equations in [[modular arithmetic]], for example), or can be limited to a finite number of possibilities (as is the case with some [[Diophantine equation]]s), the solution set can be found by [[Brute-force search|brute force]], that is, by testing each of the possible values ([[candidate solutions]]). It may be the case, though, that the number of possibilities to be considered, although finite, is so huge that an [[exhaustive search]] is not practically feasible; this is, in fact, a requirement for strong [[encryption]] methods. As with all kinds of [[problem solving]], [[trial and error]] may sometimes yield a solution, in particular where the form of the equation, or its similarity to another equation with a known solution, may lead to an "inspired guess" at the solution. If a guess, when tested, fails to be a solution, consideration of the way in which it fails may lead to a modified guess. ===Elementary algebra=== Equations involving linear or simple rational functions of a single real-valued unknown, say {{mvar|x}}, such as :<math>8x+7=4x+35 \quad \text{or} \quad \frac{4x + 9}{3x + 4} = 2 \, ,</math> can be solved using the methods of [[elementary algebra]]. ===Systems of linear equations=== Smaller [[System of linear equations|systems of linear equations]] can be solved likewise by methods of elementary algebra. For solving larger systems, algorithms are used that are based on [[linear algebra]]. ''See [[Gaussian elimination]] and [[numerical solution of linear systems]].'' ===Polynomial equations=== {{Main|Polynomial#Solving polynomial equations|l1=Solving polynomial equations}} {{see also|System of polynomial equations}} [[Polynomial]] equations of degree up to four can be solved exactly using algebraic methods, of which the [[quadratic formula]] is the simplest example. Polynomial equations with a degree of five or higher require in general numerical methods (see below) or special functions such as [[Bring radical]]s, although some specific cases may be solvable algebraically, for example :<math>4x^5 - x^3 - 3 = 0</math> (by using the [[rational root theorem]]), and :<math>x^6 - 5x^3 + 6 = 0 \, ,</math> (by using the substitution {{math|''x'' {{=}} ''z''<sup>{{frac|1|3}}</sup>}}, which simplifies this to a [[quadratic equation]] in {{mvar|z}}). ===Diophantine equations=== In [[Diophantine equations]] the solutions are required to be [[integer]]s. In some cases a brute force approach can be used, as mentioned above. In some other cases, in particular if the equation is in one unknown, it is possible to solve the equation for [[Rational number|rational]]-valued unknowns (see [[Rational root theorem]]), and then find solutions to the Diophantine equation by restricting the solution set to integer-valued solutions. For example, the polynomial equation :<math>2x^5-5x^4-x^3-7x^2+2x+3=0\,</math> has as rational solutions {{math|''x'' {{=}} −{{sfrac|1|2}}}} and {{math|''x'' {{=}} 3}}, and so, viewed as a Diophantine equation, it has the unique solution {{math|''x'' {{=}} 3}}. In general, however, Diophantine equations are among the most difficult equations to solve. ===Inverse functions=== {{See also|Inverse problem}} In the simple case of a function of one variable, say, {{math|''h''(''x'')}}, we can solve an equation of the form {{math|''h''(''x'') {{=}} ''c''}} for some constant {{mvar|c}} by considering what is known as the ''[[inverse function]]'' of {{mvar|h}}. Given a function {{math|''h'' : ''A'' → ''B''}}, the inverse function, denoted {{math|''h''<sup>−1</sup>}} and defined as {{math|''h''<sup>−1</sup> : ''B'' → ''A''}}, is a function such that :<math>h^{-1}\bigl(h(x)\bigr) = h\bigl(h^{-1}(x)\bigr) = x \,.</math> Now, if we apply the inverse function to both sides of {{math|''h''(''x'') {{=}} ''c''}}, where {{mvar|c}} is a constant value in {{mvar|B}}, we obtain :<math>\begin{align} h^{-1}\bigl(h(x)\bigr) &= h^{-1}(c) \\ x &= h^{-1}(c) \\ \end{align}</math> and we have found the solution to the equation. However, depending on the function, the inverse may be difficult to be defined, or may not be a function on all of the set {{math|B}} (only on some subset), and have many values at some point. If just one solution will do, instead of the full solution set, it is actually sufficient if only the functional identity :<math>h\left(h^{-1}(x)\right) = x</math> holds. For example, the [[projection (mathematics)|projection]] {{math|π<sub>1</sub> : '''R'''<sup>2</sup> → '''R'''}} defined by {{math|1=π<sub>1</sub>(''x'', ''y'') = ''x''}} has no post-inverse, but it has a pre-inverse {{math|π{{su|b=1|p=−1}}}} defined by {{math|1=π{{su|b=1|p=−1}}(''x'') = (''x'', 0)}}. Indeed, the equation {{math|π<sub>1</sub>(''x'', ''y'') {{=}} ''c''}} is solved by :<math>(x,y) = \pi_1^{-1}(c) = (c,0).</math> Examples of inverse functions include the [[nth root|{{mvar|n}}th root]] (inverse of {{math|''x''<sup>''n''</sup>}}); the [[logarithm]] (inverse of {{math|''a''<sup>''x''</sup>}}); the [[inverse trigonometric function]]s; and [[Lambert's W function|Lambert's {{mvar|W}} function]] (inverse of {{math|''xe''<sup>''x''</sup>}}). ===Factorization=== If the left-hand side expression of an equation {{math|''P'' {{=}} 0}} can be [[factorization|factorized]] as {{math|''P'' {{=}} ''QR''}}, the solution set of the original solution consists of the union of the solution sets of the two equations {{math|''Q'' {{=}} 0}} and {{math|''R'' {{=}} 0}}. For example, the equation :<math>\tan x + \cot x = 2</math> can be rewritten, using the identity {{math|1=tan ''x'' cot ''x'' = 1}} as :<math>\frac{\tan^2 x -2 \tan x+1}{\tan x} = 0,</math> which can be factorized into :<math>\frac{\left(\tan x - 1\right)^2}{\tan x}= 0.</math> The solutions are thus the solutions of the equation {{math|1=tan ''x'' = 1}}, and are thus the set :<math>x = \tfrac{\pi}{4} + k\pi, \quad k = 0, \pm 1, \pm 2, \ldots.</math> ===Numerical methods=== With more complicated equations in real or [[complex number]]s, simple methods to solve equations can fail. Often, [[root-finding algorithm]]s like the [[Newton–Raphson method]] can be used to find a numerical solution to an equation, which, for some applications, can be entirely sufficient to solve some problem. There are also [[Numerical_linear_algebra#Solutions_of_linear_systems|numerical methods for systems of linear equations]]. ===Matrix equations=== Equations involving [[matrix (mathematics)|matrices]] and [[Vector (mathematics and physics)|vectors]] of [[real number]]s can often be solved by using methods from [[linear algebra]]. ===Differential equations=== There is a vast body of methods for solving various kinds of [[differential equation]]s, both [[Numerical mathematics|numerically]] and [[Calculus|analytically]]. A particular class of problem that can be considered to belong here is [[integral|integration]], and the analytic methods for solving this kind of problems are now called [[symbolic integration]].{{citation needed|date=July 2019}} Solutions of differential equations can be ''[[implicit function|implicit]]'' or ''explicit''.<ref name="Zill2012">{{cite book|author=Dennis G. Zill|title=A First Course in Differential Equations with Modeling Applications|url=https://books.google.com/books?id=pasKAAAAQBAJ&q=solution|date=15 March 2012|publisher=Cengage Learning|isbn=978-1-285-40110-2}}</ref> ==See also== *[[Extraneous and missing solutions]] *[[Simultaneous equations]] *[[Equating coefficients]] *[[Solving the geodesic equations]] *[[Unification (computer science)]] — solving equations involving symbolic expressions ==References== {{reflist}} {{DEFAULTSORT:Equation Solving}} [[Category:Equations]] [[Category:Inverse functions]] [[Category:Unification (computer science)]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Citation needed
(
edit
)
Template:Cite book
(
edit
)
Template:Image frame
(
edit
)
Template:Main
(
edit
)
Template:Math
(
edit
)
Template:Mvar
(
edit
)
Template:One source
(
edit
)
Template:Redirect
(
edit
)
Template:Reflist
(
edit
)
Template:See also
(
edit
)
Template:Short description
(
edit
)