Search Results for ""
71 - 80 of 1833 for Disk_covering_problemSearch Results
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 ...
Is there a planar convex set having two distinct equichordal points? The problem was first proposed by Fujiwara (1916) and Blaschke et al. (1917), but long defied solution. ...
This problem is NP-complete (Garey and Johnson 1983).
Given a set S of n nonnegative integers, the number partitioning problem requires the division of S into two subsets such that the sums of number in each subset are as close ...
Find the shape of the curve down which a bead sliding from rest and accelerated by gravity will slip (without friction) from one point to another in the least time. The term ...
The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...
Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...
In a given acute triangle DeltaABC, find the inscribed triangle whose perimeter is as small as possible. The answer is the orthic triangle of DeltaABC. The problem was ...
Find the surface enclosing the maximum volume per unit surface area, I=V/S. The solution is a sphere, which has I_(sphere)=(4/3pir^3)/(4pir^2)=1/3r. The fact that a sphere ...
A boundary value problem is a problem, typically an ordinary differential equation or a partial differential equation, which has values assigned on the physical boundary of ...
...
View search results from all Wolfram sites (161691 matches)

