|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Unreferenced|date=December 2009}}
| | Dalton is what's written on his birth certificate but he never really favored that name. His friends say it's not good for him but what exactly he loves doing is [http://www.bing.com/search?q=regarded&form=MSNNWS&mkt=en-us&pq=regarded regarded] as acting and he's been doing doing it for many years. In your ex boyfriend's professional life he often is a filing assistant then his salary has for ages been really fulfilling. His wife and your pet live in Idaho in [http://Search.Usa.gov/search?query=addition addition] he needs to move because of his family. Go to his website much more out more: http://prometeu.net<br><br>Feel free to visit my web-site clash of clans hack android ([http://prometeu.net prometeu.net]) |
| [[Image:NewtonIteration Ani.gif|alt Illustration of Newton's method|thumb|right|300px|An example of using Newton's method to solve an equation <math>f(x)=0</math>. Newton's method is one numerical method for solving an equation.]]
| |
| In [[mathematics]], to '''solve an equation''' is to find what values ([[number]]s, [[function (mathematics)|functions]], [[Set (mathematics)|sets]], etc.) fulfill a condition stated in the form of an [[equation]] (two [[expression (mathematics)|expression]]s related by [[equality (mathematics)|equality]]). These expressions contain one or more '''unknowns''', which are [[free variable]]s for which values are sought that cause the condition to be fulfilled. To be precise, what is sought are often not necessarily actual values, but, more in general, mathematical expressions. A '''solution''' of the equation is an assignment of expressions to the unknowns that satisfies the equation; in other words, expressions such that, when they are [[Substitution (logic)|substituted]] for the unknowns, the equation becomes an [[identity (mathematics)|identity]].
| |
| | |
| For example, the equation {{nowrap|1=''x'' + ''y'' = 2''x'' – 1}} is solved for the unknown ''x'' by the solution {{nowrap|1=''x'' = ''y'' + 1}}, since substituting {{nowrap|''y'' + 1}} for ''x'' in the equation results in {{nowrap|1=(''y'' + 1) + ''y'' = 2(''y'' + 1) – 1}}, a true statement. It is also possible to take the variable ''y'' to be the unknown, and then the equation is solved by {{nowrap|1=''y'' = ''x'' – 1}}. Or ''x'' and ''y'' can both be treated as unknowns, and then there are many solutions to the equation, some of which are {{nowrap|1=(''x'', ''y'') = (1, 0)}} – that is, {{nowrap|1=''x'' = 1}} [[and (logic)|and]] {{nowrap|1=''y'' = 0}} – and {{nowrap|1=(''x'', ''y'') = (2, 1)}}, and, in general, {{nowrap|1=(''x'', ''y'') = (''a'' + 1, ''a'')}} for all possible values of ''a''.
| |
| | |
| Depending on the problem, the task may be to find one solution – any solution will do – or all solutions. The set of all solutions is called the [[solution set]]. It is also possible that the task is to find a solution, among possibly many, that is ''best'' in some respect. Problems of that nature are called [[optimization problem]]s; solving an optimization problem is generally not referred to as "equation solving".
| |
| | |
| A wording such as "an equation '''in''' ''x'' and ''y''", or "solve '''for''' ''x'' and ''y''", implies that the unknowns are as indicated: in these cases ''x'' and ''y''.
| |
| | |
| ==Overview==
| |
| In one general case, we have a situation such as
| |
| | |
| :''ƒ'' (''x''<sub>1</sub>,...,''x''<sub>''n''</sub>) = ''c'',
| |
| | |
| where ''x''<sub>1</sub>,...,''x''<sub>''n''</sub> are the unknowns, and ''c'' is a constant. Its solutions are the members of the [[inverse image]]
| |
| | |
| :''ƒ''<sup> −1</sup>[''c''] = {(''a''<sub>1</sub>,...,''a''<sub>''n''</sub>) ∈ ''T''<sub>1</sub>×···×''T''<sub>''n''</sub> | ''ƒ'' (''a''<sub>1</sub>,...,''a''<sub>n</sub>) = ''c''}, | |
| | |
| where ''T''<sub>1</sub>×···×''T''<sub>''n''</sub> is the [[Domain of a function|domain]] of the function ''ƒ''. Note that the set of solutions can be empty (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
| |
| | |
| :3''x'' + 2''y'' = 21''z''
| |
| | |
| with unknowns ''x'', ''y'' and ''z'', can be solved by first modifying the equation in some way while keeping it equivalent, such as subtracting 21''z'' from both sides of the equation to obtain
| |
| | |
| :3''x'' + 2''y'' − 21''z'' = 0
| |
| | |
| In this particular case there is not just ''one'' solution to this equation, but an infinite set of solutions, which can be written
| |
| | |
| :{(''x'', ''y'', ''z'') | 3''x'' + 2''y'' − 21''z'' = 0}.
| |
| | |
| One particular solution is ''x'' = 0, ''y'' = 0, ''z'' = 0. Two other solutions are ''x'' = 3, ''y'' = 6, ''z'' = 1, and ''x'' = 8, ''y'' = 9, ''z'' = 2. In fact, this particular set of solutions describes a ''plane'' in three-dimensional space, which passes through the three points with these coordinates.
| |
| | |
| ==Solution sets==
| |
| If the [[solution set]] is empty, then there are no ''x''<sub>''i''</sub> such that the equation
| |
| | |
| :''ƒ'' (''x''<sub>1</sub>,...,''x''<sub>n</sub>) = ''c'',
| |
| | |
| in which ''c'' is a given constant, becomes true.
| |
| | |
| For example, let us examine a classic one-variable case. Using the squaring function on the integers, that is, the function ''ƒ'' whose domain are the [[integer]]s (the whole numbers) defined by:
| |
| | |
| :''ƒ'' (''x'') = ''x''<sup>2</sup>,
| |
| | |
| consider the equation
| |
| | |
| : ''ƒ'' (''x'') = 2.
| |
| | |
| Its solution set is {}, the empty set, since 2 is not the square of an integer, so no integer solves this equation. However note that in attempting to find solutions for this equation, if we modify the function's definition – more specifically, the function's ''domain'', we can find solutions to this equation. So, if we were instead to define that the domain of ''ƒ'' consists of the [[real number]]s, the equation above has two solutions, and its solution set is
| |
| : {√2, −√2}.
| |
| | |
| We have already seen that certain solutions sets can describe surfaces. For example, in studying elementary mathematics, one knows that the solution set of an equation in the form ''ax'' + ''by'' = ''c'' with ''a'', ''b'', and ''c'' real-valued constants, with ''a'' and ''b'' not both equal to zero, forms a [[line (geometry)|line]] in the [[vector space]] '''R'''<sup>2</sup>. However, it may not always be easy to graphically depict solutions sets – for example, the solution set to an equation in the form ''ax'' + ''by'' + ''cz'' + ''dw'' = ''k'' (with ''a'', ''b'', ''c'', ''d'', and ''k'' real-valued constants) is a [[hyperplane]].
| |
| | |
| == 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; a comprehensive treatment is not possible.{{Citation needed|date=May 2013}}
| |
| | |
| In general, given a class of equations, there may be no 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. 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 ''x'', such as
| |
| | |
| :<math>8x+7=4x+35 , \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 large systems numerically, algorithms are used that are based on [[linear algebra]].
| |
| | |
| ===Polynomial equations===
| |
| {{Main|Polynomial#Solving polynomial equations|l1=Solving polynomial equations}}
| |
| {{see also|Systems 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
| |
| :4''x''<sup>5</sup> − ''x''<sup>3</sup> − 3 = 0 | |
| (by using the [[rational root theorem]]), and
| |
| :''x''<sup>6</sup> − 5''x''<sup>3</sup> + 6 = 0,
| |
| (by using the substitution ''x'' = ''z''<sup>1/3</sup>, which simplifies this to a [[quadratic equation]] in ''z'').
| |
| | |
| ===Diophantine equations===
| |
| In [[Diophantine equations]] the solutions are required to be [[integer]]s. In some case 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 ''x'' = −1/2 and ''x'' = 3, and so, viewed as a Diophantine equation, it has the unique solution ''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, ''h''(''x''), we can solve an equation of the form
| |
| | |
| :''h''(''x'') = ''c'', ''c'' constant
| |
| | |
| by considering what is known as the ''[[inverse function]]'' of ''h''.
| |
| | |
| Given a function ''h'' : ''A'' → ''B'', the inverse function, denoted ''h''<sup>−1</sup>, defined as ''h''<sup>−1</sup> : ''B'' → ''A'' is a function such that
| |
| | |
| :''h''<sup>−1</sup>(''h''(''x'')) = ''h''(''h''<sup>−1</sup>(''x'')) = ''x''. | |
| | |
| Now, if we apply the inverse function to both sides of
| |
| | |
| :''h''(''x'') = ''c'', where ''c'' is a constant value in ''B'',
| |
| | |
| we obtain
| |
| | |
| :''h''<sup>−1</sup>(''h''(''x'')) = ''h''<sup>−1</sup>(''c'')
| |
| :''x'' = ''h''<sup>−1</sup>(''c'')
| |
| | |
| 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 ''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
| |
| :''h''(''h''<sup>−1</sup>(''x'')) = ''x''
| |
| holds. For example, the [[projection (mathematics)|projection]] {{nowrap|π<sub>1</sub> : '''R'''<sup>2</sup> → '''R'''}} defined by {{nowrap|1=π<sub>1</sub>(''x'', ''y'') = ''x''}} has no post-inverse, but it has a pre-inverse π<sub>1</sub><sup>−1</sup> defined by {{nowrap|1=π<sub>1</sub><sup>−1</sup>(''x'') = (''x'', 0)}}. Indeed, the equation
| |
| :π<sub>1</sub>(''x'', ''y'') = ''c''
| |
| is solved by
| |
| :(''x'', ''y'') = π<sub>1</sub><sup>−1</sup>(''c'') = (''c'', 0).
| |
| | |
| Examples of inverse functions include the [[nth root|''n''th root]] (inverse of ''x''<sup>''n''</sup>); the [[logarithm]] (inverse of ''a''<sup>''x''</sup>); the [[inverse trigonometric function]]s; and [[Lambert's W function]] (inverse of ''x''e<sup>''x''</sup>).
| |
| | |
| ===Factorization===
| |
| If the left-hand side expression of an equation ''P'' = 0 can be [[factorization|factorized]] as ''P'' = ''QR'', the solution set of the original solution consists of the union of the solution sets of the two equations ''Q'' = 0 and ''R'' = 0.
| |
| For example, the equation
| |
| :<math>\tan x + \cot x = 2</math> | |
| can be rewritten, using the identity {{nowrap|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{(\tan x - 1)^2}{\tan x}= 0.</math>
| |
| The solutions are thus the solutions of the equation {{nowrap|1=tan ''x'' = 1}}, and are thus the set
| |
| :<math>x = \tfrac{\pi}{4} + k\pi, k = \cdots, -2, -1, 0, 1, 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.
| |
| | |
| ===Taylor series===
| |
| One well-studied area of mathematics involves examining whether we can create some simple function to approximate a more complex equation near a given point. In fact, polynomials in one or several variables can be used to approximate functions in this way – these are known as [[Taylor series]].
| |
| | |
| ===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]].
| |
| | |
| ==See also==
| |
| *[[Simultaneous equations]]
| |
| *[[Equating coefficients]]
| |
| *[[Solving the geodesic equations]]
| |
| | |
| {{DEFAULTSORT:Equation Solving}}
| |
| [[Category:Equations]]
| |
| [[Category:Inverse functions]]
| |