Search Results for ""

As proved by Sierpiński (1960), there exist infinitely many positive odd numbers k such that k·2^n+1 is composite for every n>=1. Numbers k with this property are called ...

A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a signaling NaN or sNaN is a NaN which is signaling in the sense of being most commonly returned in ...

The term "similarity transformation" is used either to refer to a geometric similarity, or to a matrix transformation that results in a similarity. A similarity ...

A simple continued fraction is a special case of a generalized continued fraction for which the partial numerators are equal to unity, i.e., a_n=1 for all n=1, 2, .... A ...

A Lie algebra is said to be simple if it is not Abelian and has no nonzero proper ideals. Over an algebraically closed field of field characteristic 0, every simple Lie ...

A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...

Inscribe two triangles DeltaA_1B_1C_1 and DeltaA_2B_2C_2 in a reference triangle DeltaABC such that A = ∠AB_1C_1=∠AC_2B_2 (1) B = ∠BC_1A_1=∠BA_2C_2 (2) C = ∠CA_1B_1=∠CB_2A_2. ...

There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...