Search Results for ""

The first definition of the logarithm was constructed by Napier and popularized through his posthumous pamphlet (Napier 1619). It this pamphlet, Napier sought to reduce the ...

The Paris-Harrington theorem is a strengthening of the finite Ramsey's theorem by requiring that the homogeneous set be large enough so that cardH>=minH. Clearly, the ...

The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...

A Pierpont prime is a prime number of the form p=2^k·3^l+1. The first few Pierpont primes are 2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, ... ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

A tree having four branches at each node. Quadtrees are used in the construction of some multidimensional databases (e.g., cartography, computer graphics, and image ...

A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...

A quotient-difference table is a triangular array of numbers constructed by drawing a sequence of n numbers in a horizontal row and placing a 1 above each. An additional "1" ...

The field of all rational and irrational numbers is called the real numbers, or simply the "reals," and denoted R. The set of real numbers is also called the continuum, ...

The Riemann theta function is a complex function of g complex variables that occurs in the construction of quasi-periodic solutions of various equations in mathematical ...