When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Equation solving - Wikipedia

    en.wikipedia.org/wiki/Equation_solving

    In mathematics, to solve an equation is to find its solutions, which are the values (numbers, functions, sets, etc.) that fulfill the condition stated by the equation, consisting generally of two expressions related by an equals sign. When seeking a solution, one or more variables are designated as unknowns. A solution is an assignment of ...

  3. Jade Mirror of the Four Unknowns - Wikipedia

    en.wikipedia.org/wiki/Jade_Mirror_of_the_Four...

    Illustrations in Jade Mirror of the Four Unknowns Jia Xian triangle. Jade Mirror of the Four Unknowns, [1] Siyuan yujian (simplified Chinese: 四元玉鉴; traditional Chinese: 四元玉鑒), also referred to as Jade Mirror of the Four Origins, [2] is a 1303 mathematical monograph by Yuan dynasty mathematician Zhu Shijie. [3]

  4. Equation - Wikipedia

    en.wikipedia.org/wiki/Equation

    This does not reduce the generality, as this can be realized by subtracting the right-hand side from both sides. The most common type of equation is a polynomial equation (commonly called also an algebraic equation) in which the two sides are polynomials. The sides of a polynomial equation contain one or more terms. For example, the equation

  5. Elementary algebra - Wikipedia

    en.wikipedia.org/wiki/Elementary_algebra

    To solve this kind of equation, the technique is add, subtract, multiply, or divide both sides of the equation by the same number in order to isolate the variable on one side of the equation. Once the variable is isolated, the other side of the equation is the value of the variable. [37] This problem and its solution are as follows: Solving for x

  6. Hilbert's tenth problem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_tenth_problem

    Hilbert's tenth problem is the tenth on the list of mathematical problems that the German mathematician David Hilbert posed in 1900. It is the challenge to provide a general algorithm that, for any given Diophantine equation (a polynomial equation with integer coefficients and a finite number of unknowns), can decide whether the equation has a solution with all unknowns taking integer values.

  7. Cramer's rule - Wikipedia

    en.wikipedia.org/wiki/Cramer's_rule

    In the case of n equations in n unknowns, it requires computation of n + 1 determinants, while Gaussian elimination produces the result with the same computational complexity as the computation of a single determinant. [8] [9] [verification needed] Cramer's rule can also be numerically unstable even for 2×2 systems. [10]

  8. Mountain climbing problem - Wikipedia

    en.wikipedia.org/wiki/Mountain_climbing_problem

    A trivial example. In mathematics, the mountain climbing problem is a mathematical problem that considers a two-dimensional mountain range (represented as a continuous function), and asks whether it is possible for two mountain climbers starting at sea level on the left and right sides of the mountain to meet at the summit, while maintaining equal altitudes at all times.

  9. Extraneous and missing solutions - Wikipedia

    en.wikipedia.org/wiki/Extraneous_and_missing...

    This counterintuitive result occurs because in the case where =, multiplying both sides by multiplies both sides by zero, and so necessarily produces a true equation just as in the first example. In general, whenever we multiply both sides of an equation by an expression involving variables, we introduce extraneous solutions wherever that ...