Search Results for ""

A formula satisfied by all Hamiltonian cycles with n nodes. Let f_j be the number of regions inside the circuit with j sides, and let g_j be the number of regions outside the ...

The heptanacci numbers are a generalization of the Fibonacci numbers defined by H_0=0, H_1=1, H_2=1, H_3=2, H_4=4, H_5=8, H_6=16, and the recurrence relation ...

There are two important theorems known as Herbrand's theorem. The first arises in ring theory. Let an ideal class be in A if it contains an ideal whose lth power is ...

A pyramid with a hexagonal base. The edge length of a hexagonal pyramid of height h is a special case of the formula for a regular n-gonal pyramid with n=6, given by ...

The hexanacci numbers are a generalization of the Fibonacci numbers defined by H_0=0, H_1=1, H_2=1, H_3=2, H_4=4, H_5=8, and the recurrence relation ...

Householder (1953) first considered the matrix that now bears his name in the first couple of pages of his book. A Householder matrix for a real vector v can be implemented ...

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

The identity _2F_1(x,-x;x+n+1;-1)=(Gamma(x+n+1)Gamma(1/2n+1))/(Gamma(x+1/2n+1)Gamma(n+1)), or equivalently ...

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...

The Laplace-Carson transform F of a real-valued function f is an integral transform defined by the formula F(p)=pint_0^inftye^(-pt)f(t)dt. (1) In most cases, the function F ...