TOPICS
Search

Search Results for ""


1131 - 1140 of 1624 for Circle Circle IntersectionSearch Results
Weill's theorem states that, given the incircle and circumcircle of a bicentric polygon of n sides, the centroid of the tangent points on the incircle is a fixed point W, ...
(Bailey 1935, p. 25), where _7F_6(a_1,...,a_7;b_1,...,b_6) and _4F_3(a_1,...,a_4;b_1,b_2,b_3) are generalized hypergeometric functions with argument z=1 and Gamma(z) is the ...
A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...
The surface area of a spherical segment. Call the radius of the sphere R, the upper and lower radii b and a, respectively, and the height of the spherical segment h. The zone ...
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 ...
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 k-subset is a subset of a set on n elements containing exactly k elements. The number of k-subsets on n elements is therefore given by the binomial coefficient (n; k). For ...
The point at which the three lines connecting the vertices of two perspective triangles concur, sometimes also called the perspective center, homology center, or pole. In the ...
The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs ...
A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...
1 ... 111|112|113|114|115|116|117 ... 163 Previous Next

...