Search Results for ""
951 - 960 of 1380 for Euler's IdentitySearch Results
Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...
In the process of attaching a k-handle to a manifold M, the boundary of M is modified by a process called (k-1)-surgery. Surgery consists of the removal of a tubular ...
A number of attractive tetrahedron 6-compounds can be constructed. The first compound (left figures) is obtained by combining three stella octangula. A second can be obtained ...
An example of a subspace of the Euclidean plane that is connected but not pathwise-connected with respect to the relative topology. It is formed by the ray y=0, x<=0 and the ...
Given a triangle center X=l:m:n, the line mnalpha+nlbeta+lmgamma=0, where alpha:beta:gamma are trilinear coordinates, is called the trilinear polar (Kimberling 1998, p. 38). ...
Given a line having trilinear coordinate equation lalpha+mbeta+ngamma=0 with respect to a reference triangle DeltaABC, the point mn:nl:lm is called the trilinear pole of the ...
A figurate number which is constructed as an octahedral number with a square pyramid removed from each of the six graph vertices, TO_n = O_(3n-2)-6P_(n-1)^((4)) (1) = ...
A Tucker hexagon is a hexagon inscribed in a reference triangle that has sides which are alternately parallel and antiparallel to the corresponding sides of the triangle. ...
A two-graph (V,Delta) on nodes V is a collection Delta of unordered triples of the vertices (the so-called "odd triples") such that each 4-tuple of V contains an even number ...
An ungraceful graph is a simple graph that does not possess a graceful labeling, i.e., a graph that is not a graceful graph (Gardner 1972). Such graphs have also been termed ...
...
View search results from all Wolfram sites (16501 matches)

