When.com Web Search

  1. Ads

    related to: problem solving involving perimeter

Search results

  1. Results From The WOW.Com Content Network
  2. Isoperimetric inequality - Wikipedia

    en.wikipedia.org/wiki/Isoperimetric_inequality

    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.

  3. Napkin folding problem - Wikipedia

    en.wikipedia.org/wiki/Napkin_folding_problem

    The napkin folding problem is a problem in geometry and the mathematics of paper folding that explores whether folding a square or a rectangular napkin can increase its perimeter. The problem is known under several names, including the Margulis napkin problem , suggesting it is due to Grigory Margulis , and the Arnold's rouble problem referring ...

  4. Goat grazing problem - Wikipedia

    en.wikipedia.org/wiki/Goat_grazing_problem

    The goat problems do not yield any new mathematical insights; rather they are primarily exercises in how to artfully deconstruct problems in order to facilitate solution. Three-dimensional analogues and planar boundary/area problems on other shapes, including the obvious rectangular barn and/or field, have been proposed and solved. [ 1 ]

  5. Buffon's needle problem - Wikipedia

    en.wikipedia.org/wiki/Buffon's_needle_problem

    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.

  6. Steiner tree problem - Wikipedia

    en.wikipedia.org/wiki/Steiner_tree_problem

    In combinatorial mathematics, the Steiner tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of problems in combinatorial optimization. While Steiner tree problems may be formulated in a number of settings, they all require an optimal interconnect for a given set of objects and a predefined ...

  7. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    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.

  8. Opaque set - Wikipedia

    en.wikipedia.org/wiki/Opaque_set

    It is unproven whether this is the shortest possible opaque set for the square, and for most other shapes this problem similarly remains unsolved. The shortest opaque set for any bounded convex set in the plane has length at most the perimeter of the set, and at least half the perimeter. For the square, a slightly stronger lower bound than half ...

  9. Elementary mathematics - Wikipedia

    en.wikipedia.org/wiki/Elementary_mathematics

    A perimeter is a path that surrounds a two-dimensional shape. The term may be used either for the path or its length - it can be thought of as the length of the outline of a shape. The perimeter of a circle or ellipse is called its circumference. Area is the quantity that expresses the extent of a two-dimensional figure or shape.