Search results
Results From The WOW.Com Content Network
Malfatti's assumption that the two problems are equivalent is incorrect. Lob and Richmond (), who went back to the original Italian text, observed that for some triangles a larger area can be achieved by a greedy algorithm that inscribes a single circle of maximal radius within the triangle, inscribes a second circle within one of the three remaining corners of the triangle, the one with the ...
The optimal packing of 15 circles in a square Optimal solutions have been proven for n ≤ 30. Packing circles in a rectangle; Packing circles in an isosceles right triangle - good estimates are known for n < 300. Packing circles in an equilateral triangle - Optimal solutions are known for n < 13, and conjectures are available for n < 28. [14]
The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.
Word problem from the Līlāvatī (12th century), with its English translation and solution. In science education, a word problem is a mathematical exercise (such as in a textbook, worksheet, or exam) where significant background information on the problem is presented in ordinary language rather than in mathematical notation.
A compact binary circle packing with the most similarly sized circles possible. [7] It is also the densest possible packing of discs with this size ratio (ratio of 0.6375559772 with packing fraction (area density) of 0.910683). [8] There are also a range of problems which permit the sizes of the circles to be non-uniform.
Circle packing in an equilateral triangle is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest possible equilateral triangle. Optimal solutions are known for n < 13 and for any triangular number of circles, and conjectures are available for n < 28. [1] [2] [3]
The apparent triangles formed from the figures are 13 units wide and 5 units tall, so it appears that the area should be S = 13×5 / 2 = 32.5 units. However, the blue triangle has a ratio of 5:2 (=2.5), while the red triangle has the ratio 8:3 (≈2.667), so the apparent combined hypotenuse in each figure is actually bent.
Circular triangles give the solution to an isoperimetric problem in which one seeks a curve of minimum length that encloses three given points and has a prescribed area. . When the area is at least as large as the circumcircle of the points, the solution is any circle of that area surrounding the poi