Search Results for ""
91 - 100 of 391 for Amicable PairSearch Results
Two numbers are homogeneous if they have identical prime factors. An example of a homogeneous pair is (6, 72), both of which share prime factors 2 and 3: 6 = 2·3 (1) 72 = ...
Let M be a sigma-algebra M, and let lambda_1 and lambda_2 be measures on M. If there exists a pair of disjoint sets A and B such that lambda_1 is concentrated on A and ...
Given a pair of orthologic triangles, the point where the perpendiculars from the vertices of the first to the sides of the second concur and the point where the ...
In the classical quasithin case of the quasithin theorem, if a group G does not have a "strongly embedded" subgroup, then G is a group of Lie-type in characteristic 2 of Lie ...
A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...
The integral transform obtained by defining omega=-tan(1/2delta), (1) and writing H(omega)=R(omega)+iX(omega), (2) where R(omega) and X(omega) are a Hilbert transform pair as ...
The truncated pentakis dodecahedral graph, illustrated above in a pair of embeddings, is the skeleton of the truncated pentakis dodecahedron. It has 180 vertices, 270 edges, ...
A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...
There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...
If a cyclic quadrilateral ABCD is inscribed in a circle c_1 of a coaxal system such that one pair AC of connectors touches another circle c_2 of the system at P, then each ...
...
View search results from all Wolfram sites (4042 matches)

