Search Results for ""

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...

The square of the area of the base (i.e., the face opposite the right trihedron) of a trirectangular tetrahedron is equal to the sum of the squares of the areas of its other ...

The de Longchamps ellipse of a triangle DeltaABC is the conic circumscribed on the incentral triangle and the Cevian triangle of the isogonal mittenpunkt X_(57). (Since a ...

The de Longchamps line is central line L_(32) with trilinear equation a^3alpha+b^3beta+c^3gamma=0 (Droussent 1953; Kimberling 1998, p. 150) which is the anticomplement of the ...

e^(i(ntheta))=(e^(itheta))^n. (1) From the Euler formula it follows that cos(ntheta)+isin(ntheta)=(costheta+isintheta)^n. (2) A similar identity holds for the hyperbolic ...

Let union represent "or", intersection represent "and", and ^' represent "not." Then, for two logical units E and F, (E union F)^'=E^' intersection F^' (E intersection ...

Every even number is the difference of two consecutive primes in infinitely many ways (Dickson 2005, p. 424). If true, taking the difference 2, this conjecture implies that ...

de Rham cohomology is a formal set-up for the analytic problem: If you have a differential k-form omega on a manifold M, is it the exterior derivative of another differential ...

A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...

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 ...