When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Folium of Descartes - Wikipedia

    en.wikipedia.org/wiki/Folium_of_Descartes

    The curve was first proposed and studied by René Descartes in 1638. [1] Its claim to fame lies in an incident in the development of calculus.Descartes challenged Pierre de Fermat to find the tangent line to the curve at an arbitrary point since Fermat had recently discovered a method for finding tangent lines.

  3. Cubic function - Wikipedia

    en.wikipedia.org/wiki/Cubic_function

    The points P 1, P 2, and P 3 (in blue) are collinear and belong to the graph of x 3 + ⁠ 3 / 2x 2 − ⁠ 5 / 2x + ⁠ 5 / 4 ⁠. The points T 1, T 2, and T 3 (in red) are the intersections of the (dotted) tangent lines to the graph at these points with the graph itself. They are collinear too.

  4. Graph of a function - Wikipedia

    en.wikipedia.org/wiki/Graph_of_a_function

    Given a function: from a set X (the domain) to a set Y (the codomain), the graph of the function is the set [4] = {(, ()):}, which is a subset of the Cartesian product.In the definition of a function in terms of set theory, it is common to identify a function with its graph, although, formally, a function is formed by the triple consisting of its domain, its codomain and its graph.

  5. Regular graph - Wikipedia

    en.wikipedia.org/wiki/Regular_graph

    Regular graphs of degree at most 2 are easy to classify: a 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of a disjoint union of cycles and infinite chains. A 3-regular graph is known as a cubic graph.

  6. Cubic graph - Wikipedia

    en.wikipedia.org/wiki/Cubic_graph

    According to Brooks' theorem every connected cubic graph other than the complete graph K 4 has a vertex coloring with at most three colors. Therefore, every connected cubic graph other than K 4 has an independent set of at least n/3 vertices, where n is the number of vertices in the graph: for instance, the largest color class in a 3-coloring has at least this many vertices.

  7. Binomial theorem - Wikipedia

    en.wikipedia.org/wiki/Binomial_theorem

    In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial.According to the theorem, the power ⁠ (+) ⁠ expands into a polynomial with terms of the form ⁠ ⁠, where the exponents ⁠ ⁠ and ⁠ ⁠ are nonnegative integers satisfying ⁠ + = ⁠ and the coefficient ⁠ ⁠ of each term is a specific positive integer ...

  8. Linear equation - Wikipedia

    en.wikipedia.org/wiki/Linear_equation

    Vertical line of equation x = a Horizontal line of equation y = b. Each solution (x, y) of a linear equation + + = may be viewed as the Cartesian coordinates of a point in the Euclidean plane. With this interpretation, all solutions of the equation form a line, provided that a and b are not both zero. Conversely, every line is the set of all ...

  9. Three-dimensional graph - Wikipedia

    en.wikipedia.org/wiki/Three-dimensional_graph

    The graph of a function of two variables, embedded into a three-dimensional space Topics referred to by the same term This disambiguation page lists mathematics articles associated with the same title.