Ads
related to: problem solving involving perimeter and width calculator
Search results
Results From The WOW.Com Content Network
where L is the perimeter of the lemniscate of Bernoulli with focal distance c. V = 4 3 π r 3 {\displaystyle V={4 \over 3}\pi r^{3}} where V is the volume of a sphere and r is the radius.
The problem may be reduced to the quartic equation x 3 (x − c) − 1 = 0, which can be solved by approximation methods, as suggested by Gardner, or the quartic may be solved in closed form by Ferrari's method. Once x is obtained, the width of the alley is readily calculated. A derivation of the quartic is given below, along with the desired ...
The isoperimetric problem is to determine a plane figure of the largest possible area whose boundary has a specified length. [1] The closely related Dido's problem asks for a region of the maximal area bounded by a straight line and a curvilinear arc whose endpoints belong to that line.
In probability theory, Buffon's needle problem is a question first posed in the 18th century by Georges-Louis Leclerc, Comte de Buffon: [1] Suppose we have a floor made of parallel strips of wood , each the same width, and we drop a needle onto the floor.
Bellman's lost-in-a-forest problem is an unsolved minimization problem in geometry, originating in 1955 by the American applied mathematician Richard E. Bellman. [1] The problem is often stated as follows: "A hiker is lost in a forest whose shape and dimensions are precisely known to him.
This problem is known as the primitive circle problem, as it involves searching for primitive solutions to the original circle problem. [9] It can be intuitively understood as the question of how many trees within a distance of r are visible in the Euclid's orchard , standing in the origin.
In mathematics, the moving sofa problem or sofa problem is a two-dimensional idealization of real-life furniture-moving problems and asks for the rigid two-dimensional shape of the largest area that can be maneuvered through an L-shaped planar region with legs of unit width. [1] The area thus obtained is referred to as the sofa constant.
Geometric constraint solving is constraint satisfaction in a computational geometry setting, which has primary applications in computer aided design. [1] A problem to be solved consists of a given set of geometric elements and a description of geometric constraints between the elements, which could be non-parametric (tangency, horizontality, coaxiality, etc) or parametric (like distance, angle ...