Search Results for ""

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

Gregory's formula is a formula that allows a definite integral of a function to be expressed by its sum and differences, or its sum by its integral and difference (Jordan ...

An equation derived by Kronecker: where r(n) is the sum of squares function, zeta(z) is the Riemann zeta function, eta(z) is the Dirichlet eta function, Gamma(z) is the gamma ...

With three cuts, dissect an equilateral triangle into a square. The problem was first proposed by Dudeney in 1902, and subsequently discussed in Dudeney (1958), and Gardner ...

The Jacobian of the derivatives partialf/partialx_1, partialf/partialx_2, ..., partialf/partialx_n of a function f(x_1,x_2,...,x_n) with respect to x_1, x_2, ..., x_n is ...

A generalization of the Fibonacci numbers defined by the four constants (p,q,r,s) and the definitions H_0=p and H_1=q together with the linear recurrence equation ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...