Search Results for ""

The forward difference is a finite difference defined by Deltaa_n=a_(n+1)-a_n. (1) Higher order differences are obtained by repeated operations of the forward difference ...

The Fourier transform of a Gaussian function f(x)=e^(-ax^2) is given by F_x[e^(-ax^2)](k) = int_(-infty)^inftye^(-ax^2)e^(-2piikx)dx (1) = ...

The fractional derivative of f(t) of order mu>0 (if it exists) can be defined in terms of the fractional integral D^(-nu)f(t) as D^muf(t)=D^m[D^(-(m-mu))f(t)], (1) where m is ...

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

A strophoid of a circle with the pole O at the center of the circle and the fixed point P on the circumference of the circle. Freeth (1878, pp. 130 and 228) described this ...

Also known as the Serret-Frenet formulas, these vector differential equations relate inherent properties of a parametrized curve. In matrix form, they can be written [T^.; ...

Functional analysis is a branch of mathematics concerned with infinite-dimensional vector spaces (mainly function spaces) and mappings between them. The spaces may be of ...

Every polynomial equation having complex coefficients and degree >=1 has at least one complex root. This theorem was first proven by Gauss. It is equivalent to the statement ...

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...