enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Cubic function - Wikipedia

    en.wikipedia.org/wiki/Cubic_function

    The critical points of a cubic function are its stationary points, that is the points where the slope of the function is zero. [2] Thus the critical points of a cubic function f defined by f(x) = ax 3 + bx 2 + cx + d, occur at values of x such that the derivative + + = of the cubic function is zero.

  3. Cubic equation - Wikipedia

    en.wikipedia.org/wiki/Cubic_equation

    For solving the cubic equation x 3 + m 2 x = n where n > 0, Omar Khayyám constructed the parabola y = x 2 /m, the circle that has as a diameter the line segment [0, n/m 2] on the positive x-axis, and a vertical line through the point where the circle and the parabola intersect above the x-axis.

  4. Cubic plane curve - Wikipedia

    en.wikipedia.org/wiki/Cubic_plane_curve

    Singular cubic y 2 = x 2 ⋅ (x + 1). A parametrization is given by t ↦ (t 2 – 1, t ⋅ (t 2 – 1)). A cubic curve may have a singular point, in which case it has a parametrization in terms of a projective line. Otherwise a non-singular cubic curve is known to have nine points of inflection, over an algebraically closed field such as the ...

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

  6. Table of simple cubic graphs - Wikipedia

    en.wikipedia.org/wiki/Table_of_simple_cubic_graphs

    The number of connected simple cubic graphs on 4, 6, 8, 10, ... vertices is 1, 2, 5, 19, ... (sequence A002851 in the OEIS).A classification according to edge connectivity is made as follows: the 1-connected and 2-connected graphs are defined as usual.

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

  8. Exponentiation - Wikipedia

    en.wikipedia.org/wiki/Exponentiation

    Graphs of y = b x for various bases b: base 10, base e, base 2, base ⁠ 1 / 2 ⁠. Each curve passes through the point (0, 1) because any nonzero number raised to the power of 0 is 1. At x = 1, the value of y equals the base because any number raised to the power of 1 is the number itself.

  9. Floor and ceiling functions - Wikipedia

    en.wikipedia.org/wiki/Floor_and_ceiling_functions

    At points of discontinuity, a Fourier series converges to a value that is the average of its limits on the left and the right, unlike the floor, ceiling and fractional part functions: for y fixed and x a multiple of y the Fourier series given converges to y/2, rather than to x mod y = 0. At points of continuity the series converges to the true ...