TOPICS
Search

Search Results for ""


8441 - 8450 of 13135 for Highly Composite NumberSearch Results
The Jerabek hyperbola is a circumconic that is the isogonal conjugate of the Euler line (Kimberling 1998, p. 237). Since it is a circumconic passing through the orthocenter, ...
The Kubo-Martin-Schwinger (KMS) condition is a kind of boundary-value condition which naturally emerges in quantum statistical mechanics and related areas. Given a quantum ...
A the (first, or internal) Kenmotu point, also called the congruent squares point, is the triangle center constructed by inscribing three equal squares such that each square ...
The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...
The Kuen surface is a special case of Enneper's negative curvature surfaces which can be given parametrically by x = (2(cosu+usinu)sinv)/(1+u^2sin^2v) (1) = ...
The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...
A polygon whose vertices are points of a point lattice. Regular lattice n-gons exists only for n=3, 4, and 6 (Schoenberg 1937, Klamkin and Chrestenson 1963, Maehara 1993). A ...
A short theorem used in proving a larger theorem. Related concepts are the axiom, porism, postulate, principle, and theorem. The late mathematician P. Erdős has often been ...
A transformation of the form w=f(z)=(az+b)/(cz+d), (1) where a, b, c, d in C and ad-bc!=0, (2) is a conformal mapping called a linear fractional transformation. The ...
Intuitively, a d-dimensional discrete percolation model is said to be long-range if direct flow is possible between pairs of graph vertices or graph edges which are "very ...
1 ... 842|843|844|845|846|847|848 ... 1314 Previous Next

...