Search Results for ""

Klee's identity is the binomial sum sum_(k=0)^n(-1)^k(n; k)(n+k; m)=(-1)^n(n; m-n), where (n; k) is a binomial coefficient. For m=0, 1, ... and n=0, 1,..., the following ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

The regular octahedron, often simply called "the" octahedron, is the Platonic solid with six polyhedron vertices, 12 polyhedron edges, and eight equivalent equilateral ...

The pathological function f_a(x)=sum_(k=1)^infty(sin(pik^ax))/(pik^a) (originally defined for a=2) that is continuous but differentiable only on a set of points of measure ...

Two or more lines are said to be concurrent if they intersect in a single point. Two lines concur if their trilinear coordinates satisfy |l_1 m_1 n_1; l_2 m_2 n_2; l_3 m_3 ...

sum_(n=0)^(N-1)e^(inx) = (1-e^(iNx))/(1-e^(ix)) (1) = (-e^(iNx/2)(e^(-iNx/2)-e^(iNx/2)))/(-e^(ix/2)(e^(-ix/2)-e^(ix/2))) (2) = (sin(1/2Nx))/(sin(1/2x))e^(ix(N-1)/2), (3) ...

Given two circles, draw the tangents from the center of each circle to the sides of the other. Then the line segments AB and CD are of equal length. The theorem can be proved ...