TOPICS
Search

Search Results for ""


1291 - 1300 of 1833 for Disk covering problemSearch Results
A special graph vertex that is designated to turn a tree into a rooted tree or a graph into a rooted graph. The root is sometimes also called "eve," or an "endpoint" (Saaty ...
The so-called rule of three is an educational tool utilized historically to verbalize the process of solving basic linear equations with four terms where three of the terms ...
Russian roulette is a game of chance in which one or more of the six chambers of a revolver are filled with cartridges, the chamber is rotated at random, and the gun is ...
There are at least two theorems known as Salmon's theorem. This first states that if P and S are two points, PX and SY are the perpendiculars from P and S to the polars of S ...
Informally, the sample space for a given set of events is the set of all possible values the events may assume. Formally, the set of possible events for a given random ...
In n dimensions for n>=5 the arrangement of hyperspheres whose convex hull has minimal content is always a "sausage" (a set of hyperspheres arranged with centers along a ...
Let lambda_1, ..., lambda_n in C be linearly independent over the rationals Q, then Q(lambda_1,...,lambda_n,e^(lambda_1),...,e^(lambda_n)) has transcendence degree at least n ...
The concurrence S of the Euler lines E_n of the triangles DeltaXBC, DeltaXCA, DeltaXAB, and DeltaABC where X is the incenter. It has equivalent triangle center functions ...
If f_1(x), ..., f_s(x) are irreducible polynomials with integer coefficients such that no integer n>1 divides f_1(x), ..., f_s(x) for all integers x, then there should exist ...
A conformal mapping from the upper half-plane to a polygon.
1 ... 127|128|129|130|131|132|133 ... 184 Previous Next

...