Search Results for ""

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

The trapezo-rhombic dodecahedron, also called the rhombo-trapezoidal dodecahedron, is a general dodecahedron consisting of six identical rhombi and six identical isosceles ...

Triangle geometry is the study of the properties of triangles, including associated triangle centers, triangle lines, central circles, triangle cubics, and many others. These ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

Consider the solid enclosed by the three hyperboloids specified by the inequalities x^2+y^2-z^2 <= 1 (1) y^2+z^2-x^2 <= 1 (2) z^2+x^2-y^2 <= 1. (3) This work dubs this solid ...

A twin prime cluster of order n is a collection of 2n consecutive prime numbers such that consecutive pairs form twin primes. Twin prime clusters were discussed by Mudge ...

A number of the form aba..., abab..., etc. The first few nontrivial undulants (with the stipulation that a!=b) are 101, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, ... ...

The distribution for the sum X_1+X_2+...+X_n of n uniform variates on the interval [0,1] can be found directly as (1) where delta(x) is a delta function. A more elegant ...

A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...