Search Results for ""
151 - 160 of 1636 for Bin Packing ProblemSearch Results
Is it possible to cover completely the surface of a sphere with congruent, nonoverlapping arcs of great circles? Conway and Croft (1964) proved that it can be covered with ...
An unsolved problem in mathematics attributed to Lehmer (1933) that concerns the minimum Mahler measure M_1(P) for a univariate polynomial P(x) that is not a product of ...
Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...
Given five equal disks placed symmetrically about a given center, what is the smallest radius r for which the radius of the circular area covered by the five disks is 1? The ...
Place a point somewhere on a line segment. Now place a second point and number it 2 so that each of the points is in a different half of the line segment. Continue, placing ...
What is the longest ladder that can be moved around a right-angled hallway of unit width? For a straight, rigid ladder, the answer is 2sqrt(2), which allows the ladder to ...
Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...
Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...
A dot plot, also called a dot chart, is a type of simple histogram-like chart used in statistics for relatively small data sets where values fall into a number of discrete ...
What is the sofa of greatest area S which can be moved around a right-angled hallway of unit width? Hammersley (Croft et al. 1994) showed that S>=pi/2+2/pi=2.2074... (1) ...
...
View search results from all Wolfram sites (160700 matches)

