Search Results for ""

If a function f(x) is continuous on a closed interval [a,b], then f(x) has both a maximum and a minimum on [a,b]. If f(x) has an extremum on an open interval (a,b), then the ...

A subset F subset R of the real numbers is said to be an F_sigma set provided F is the countable union of closed sets. The name F_sigma comes from French: The F stands for ...

A subset G subset R of the real numbers is said to be a G_delta set provided G is the countable intersection of open sets. The name G_delta comes from German: The G stands ...

Implicit differentiation is the procedure of differentiating an implicit equation with respect to the desired variable x while treating the other variables as unspecified ...

An inflection point is a point on a curve at which the sign of the curvature (i.e., the concavity) changes. Inflection points may be stationary points, but are not local ...

The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...

The inverse function of the Gudermannian y=gd^(-1)phi gives the vertical position y in the Mercator projection in terms of the latitude phi and may be defined for 0<=x<pi/2 ...

The line integral of a vector field F(x) on a curve sigma is defined by int_(sigma)F·ds=int_a^bF(sigma(t))·sigma^'(t)dt, (1) where a·b denotes a dot product. In Cartesian ...

Numerical differentiation is the process of finding the numerical value of a derivative of a given function at a given point. In general, numerical differentiation is more ...

Polynomials s_k(x;lambda,mu) which are a generalization of the Boole polynomials, form the Sheffer sequence for g(t) = (1+e^(lambdat))^mu (1) f(t) = e^t-1 (2) and have ...