enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Mordell curve - Wikipedia

    en.wikipedia.org/wiki/Mordell_curve

    If (x, y) is an integer point on a Mordell curve, then so is (x, −y). If (x, y) is a rational point on a Mordell curve with y ≠ 0, then so is (⁠ x 4 − 8nx / 4y 2 ⁠, ⁠ −x 6 − 20nx 3 + 8n 2 / 8y 3 ⁠). Moreover, if xy ≠ 0 and n is not 1 or −432, an infinite number of rational solutions can be generated this way.

  3. 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.

  4. 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 / 2 ⁠ x 2 − ⁠ 5 / 2 ⁠ x + ⁠ 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. The tangent lines to the graph of a ...

  5. Graph (discrete mathematics) - Wikipedia

    en.wikipedia.org/wiki/Graph_(discrete_mathematics)

    A graph with three vertices and three edges. A graph (sometimes called an undirected graph to distinguish it from a directed graph, or a simple graph to distinguish it from a multigraph) [4] [5] is a pair G = (V, E), where V is a set whose elements are called vertices (singular: vertex), and E is a set of unordered pairs {,} of vertices, whose elements are called edges (sometimes links or lines).

  6. Graph (abstract data type) - Wikipedia

    en.wikipedia.org/wiki/Graph_(abstract_data_type)

    remove_vertex(G, x): removes the vertex x, if it is there; add_edge(G, x, y, z): adds the edge z from the vertex x to the vertex y, if it is not there; remove_edge(G, x, y): removes the edge from the vertex x to the vertex y, if it is there; get_vertex_value(G, x): returns the value associated with the vertex x; set_vertex_value(G, x, v): sets ...

  7. List of graphs by edges and vertices - Wikipedia

    en.wikipedia.org/wiki/List_of_graphs_by_edges...

    This sortable list points to the articles describing various individual (finite) graphs. [1] The columns 'vertices', 'edges', ' radius ', ' diameter ', ' girth ', 'P' (whether the graph is planar ), χ ( chromatic number ) and χ' ( chromatic index ) are also sortable, allowing to search for a parameter or another.

  8. Asymptote - Wikipedia

    en.wikipedia.org/wiki/Asymptote

    For example, the upper right branch of the curve y = 1/x can be defined parametrically as x = t, y = 1/t (where t > 0). First, x → ∞ as t → ∞ and the distance from the curve to the x-axis is 1/t which approaches 0 as t → ∞. Therefore, the x-axis is an asymptote of the curve.

  9. Multiplicative inverse - Wikipedia

    en.wikipedia.org/wiki/Multiplicative_inverse

    The reciprocal function: y = 1/x.For every x except 0, y represents its multiplicative inverse. The graph forms a rectangular hyperbola.. In mathematics, a multiplicative inverse or reciprocal for a number x, denoted by 1/x or x1, is a number which when multiplied by x yields the multiplicative identity, 1.