Search Results for ""

A double factorial prime is a prime number of the form n!!+/-1, where n!! is a double factorial. n!!-1 is prime for n=3, 4, 6, 8, 16, 26, 64, 82, 90, 118, 194, 214, 728, ... ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

A chord which is a normal at each end. A centrosymmetric set K subset R^d has d double normals through the center (Croft et al. 1991). For a curve of constant width, all ...

The double graph of a given graph G is constructed by making two copies of G (including the initial edge set of each) and adding edges u_1v_2 and v_1u_2 for every edge uv of ...

A double integral is a two-fold multiple integral. Examples of definite double integrals evaluating to simple constants include int_0^1int_0^1(dxdy)/(1-x^2y^2) = 1/8pi^2 (1) ...

Two cones placed apex to apex. The double cone is given by algebraic equation (z^2)/(c^2)=(x^2+y^2)/(a^2).

The symbol | which is not used very commonly in mathematics. The double dagger is also known as the double obelisk or diesis (Bringhurst 1997, p. 275).

The double sphere is the degenerate quartic surface (x^2+y^2+z^2-r^2)^2=0 obtained by squaring the left-hand side of the equation of a usual sphere x^2+y^2+z^2-r^2=0.

The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...

A cycle double cover of an undirected graph is a collection of cycles that cover each edge of the graph exactly twice. For a polyhedral graph, the faces of a corresponding ...