Search Results for ""
291 - 300 of 1033 for Largest small octagonSearch Results
Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 and m=2,3, but only a small ...
A rational number is a number that can be expressed as a fraction p/q where p and q are integers and q!=0. A rational number p/q is said to have numerator p and denominator ...
Skewness is a measure of the degree of asymmetry of a distribution. If the left tail (tail at small end of the distribution) is more pronounced than the right tail (tail at ...
The deltoidal icositetrahedron is the 24-faced dual polyhedron of the small rhombicuboctahedron A_6 and Wenninger dual W_(13). It is also called the trapezoidal ...
An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...
A cube can be divided into n subcubes for only n=1, 8, 15, 20, 22, 27, 29, 34, 36, 38, 39, 41, 43, 45, 46, and n>=48 (OEIS A014544; Hadwiger 1946; Scott 1947; Gardner 1992, ...
The floor function |_x_|, also called the greatest integer function or integer value (Spanier and Oldham 1987), gives the largest integer less than or equal to x. The name ...
The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Delta(n) of the smallest of the ...
The Laguerre polynomials are solutions L_n(x) to the Laguerre differential equation with nu=0. They are illustrated above for x in [0,1] and n=1, 2, ..., 5, and implemented ...
In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...
...
View search results from all Wolfram sites (15348 matches)

