Search Results for ""

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

Two figures are said to be similar when all corresponding angles are equal, and are directly similar when all corresponding angles are equal and described in the same ...

A Dirichlet L-series is a series of the form L_k(s,chi)=sum_(n=1)^inftychi_k(n)n^(-s), (1) where the number theoretic character chi_k(n) is an integer function with period k, ...

A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...

Let G be an algebraic group. G together with the discrete topology is a locally compact group and one may consider the counting measure as a left invariant Haar measure on G. ...

A discriminant is a quantity (usually invariant under certain classes of transformations) which characterizes certain properties of a quantity's roots. The concept of the ...

The divergence theorem, more commonly known especially in older literature as Gauss's theorem (e.g., Arfken 1985) and also known as the Gauss-Ostrogradsky theorem, is a ...

The dodecahedron-icosahedron compound is a polyhedron compound consisting of a dodecahedron and its dual the icosahedron. In the compound, the dodecahedron and icosahedron ...

A (general) dodecahedron is a polyhedron having 12 faces. Examples include the Bilinski dodecahedron, decagonal prism, elongated square dipyramid (Johnson solid J_(15)), ...

The domino is the unique free (and one-sided) 2-polyomino consisting of two equal squares connected along a complete polygon edge. There are two fixed dominoes.