When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Special cases of Apollonius' problem - Wikipedia

    en.wikipedia.org/wiki/Special_cases_of_Apollonius...

    In general, the same inversion transforms the given line L and given circle C into two new circles, c 1 and c 2. Thus, the problem becomes that of finding a solution line tangent to the two inverted circles, which was solved above. There are four such lines, and re-inversion transforms them into the four solution circles of the Apollonius problem.

  3. Problem of Apollonius - Wikipedia

    en.wikipedia.org/wiki/Problem_of_Apollonius

    There are four such solution lines, which may be constructed from the external and internal homothetic centers of the two circles. Re-inversion in P and undoing the resizing transforms such a solution line into the desired solution circle of the original Apollonius problem. All eight general solutions can be obtained by shrinking and swelling ...

  4. List of NP-complete problems - Wikipedia

    en.wikipedia.org/wiki/List_of_NP-complete_problems

    The variant where variables are required to be 0 or 1, called zero-one linear programming, and several other variants are also NP-complete [2] [3]: MP1 Some problems related to Job-shop scheduling; Knapsack problem, quadratic knapsack problem, and several variants [2] [3]: MP9 Some problems related to Multiprocessor scheduling

  5. Dividing a circle into areas - Wikipedia

    en.wikipedia.org/wiki/Dividing_a_circle_into_areas

    The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.

  6. Curve fitting - Wikipedia

    en.wikipedia.org/wiki/Curve_fitting

    For example, a first degree polynomial (a line) constrained by only a single point, instead of the usual two, would give an infinite number of solutions. This brings up the problem of how to compare and choose just one solution, which can be a problem for software and for humans, as well. For this reason, it is usually best to choose as low a ...

  7. Smoothness - Wikipedia

    en.wikipedia.org/wiki/Smoothness

    Simple examples of functions that are smooth but not analytic at any point can be made by means of Fourier series; another example is the Fabius function. Although it might seem that such functions are the exception rather than the rule, it turns out that the analytic functions are scattered very thinly among the smooth ones; more rigorously ...

  8. Smale's problems - Wikipedia

    en.wikipedia.org/wiki/Smale's_problems

    Smale's problems is a list of eighteen unsolved problems in mathematics proposed by Steve Smale in 1998 [1] and republished in 1999. [2] Smale composed this list in reply to a request from Vladimir Arnold, then vice-president of the International Mathematical Union, who asked several mathematicians to propose a list of problems for the 21st century.

  9. System of linear equations - Wikipedia

    en.wikipedia.org/wiki/System_of_linear_equations

    Each free variable gives the solution space one degree of freedom, the number of which is equal to the dimension of the solution set. For example, the solution set for the above equation is a line, since a point in the solution set can be chosen by specifying the value of the parameter z. An infinite solution of higher order may describe a ...