TOPICS
Search

Search Results for ""


3001 - 3010 of 3715 for One-step equationsSearch Results
An integer sequence whose terms are defined in terms of number-related words in some language. For example, the following table gives the sequences of numbers having digits ...
Let three isoscelizers I_(AC)I_(AB), I_(BA)I_(BC), and I_(CA)I_(CB) be constructed on a triangle DeltaABC, one for each side. This makes all of the inner triangles similar to ...
A Z-number is a real number xi such that 0<=frac[(3/2)^kxi]<1/2 for all k=1, 2, ..., where frac(x) is the fractional part of x. Mahler (1968) showed that there is at most one ...
A nonzero element x of a ring for which x·y=0, where y is some other nonzero element and the multiplication x·y is the multiplication of the ring. A ring with no zero ...
A zonal harmonic is a spherical harmonic of the form P_l(costheta), i.e., one which reduces to a Legendre polynomial (Whittaker and Watson 1990, p. 302). These harmonics are ...
Two distinct theorems are referred to as "the de Bruijn-Erdős theorem." One of them (de Bruijn and Erdős 1951) concerns the chromatic number of infinite graphs; the other (de ...
A k-coloring of a graph G is a vertex coloring that is an assignment of one of k possible colors to each vertex of G (i.e., a vertex coloring) such that no two adjacent ...
Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...
A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...
A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...
1 ... 298|299|300|301|302|303|304 ... 372 Previous Next

...