Search Results for ""

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

The derivative of a function represents an infinitesimal change in the function with respect to one of its variables. The "simple" derivative of a function f with respect to ...

The Euler numbers, also called the secant numbers or zig numbers, are defined for |x|<pi/2 by sechx-1=-(E_1^*x^2)/(2!)+(E_2^*x^4)/(4!)-(E_3^*x^6)/(6!)+... (1) ...

The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...

An integral of the form intf(z)dz, (1) i.e., without upper and lower limits, also called an antiderivative. The first fundamental theorem of calculus allows definite ...

The Kirchhoff index Kf, also simply called the resistance and denoted R (Lukovits et al. 1999), of a connected graph G on n nodes is defined by ...

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

The simple continued fraction for pi is given by [3; 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2, 2, 2, ...] (OEIS A001203). A plot of the first 256 terms of the ...