Search Results for ""

A trip-let is a three-dimensional solid that is shaped in such a way that its projections along three mutually perpendicular axes are three different letters of the alphabet. ...

Let F_n be the nth Fibonacci number, and let (p|5) be a Legendre symbol so that e_p=(p/5)={1 for p=1,4 (mod 5); -1 for p=2,3 (mod 5). (1) A prime p is called a Wall-Sun-Sun ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...

If S is any nonempty partially ordered set in which every chain has an upper bound, then S has a maximal element. This statement is equivalent to the axiom of choice. Renteln ...

The term annihilator is used in several different ways in various aspects of mathematics. It is most commonly used to mean the set of all functions satisfying a given set of ...

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.