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

Hadjicostas's formula is a generalization of the unit square double integral gamma=int_0^1int_0^1(x-1)/((1-xy)ln(xy))dxdy (1) (Sondow 2003, 2005; Borwein et al. 2004, p. 49), ...

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 Hurwitz zeta function zeta(s,a) is a generalization of the Riemann zeta function zeta(s) that is also known as the generalized zeta function. It is classically defined by ...

Let |A| denote the cardinal number of set A, then it follows immediately that |A union B|=|A|+|B|-|A intersection B|, (1) where union denotes union, and intersection denotes ...