Search Results for ""

An orthodiagonal quadrangle is a quadrangle whose diagonals are perpendicular to each other. If a, b, c, and d are the sides of a quadrangle, then this quadrangle is ...

Define the notation [n]f_0=f_(-(n-1)/2)+...+f_0+...+f_((n-1)/2) (1) and let delta be the central difference, so delta^2f_0=f_1-2f_0+f_(-1). (2) Spencer's 21-term moving ...

The cubitruncated cuboctahedral graph is the skeleton of the cubitruncated cuboctahedron, which is the only uniform polyhedron for which this is the case. It is illustrated ...

Consider a power series in a complex variable z g(z)=sum_(n=0)^inftya_nz^n (1) that is convergent within the open disk D:|z|<R. Convergence is limited to within D by the ...

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

A set S in a metric space (S,d) is bounded if it has a finite generalized diameter, i.e., there is an R<infty such that d(x,y)<=R for all x,y in S. A set in R^n is bounded ...

The projective special linear group PSL_n(q) is the group obtained from the special linear group SL_n(q) on factoring by the scalar matrices contained in that group. It is ...

If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...