Search results
Results From The WOW.Com Content Network
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.
Many of these problems are easily solvable provided that other geometric transformations are allowed; for example, neusis construction can be used to solve the former two problems. In terms of algebra , a length is constructible if and only if it represents a constructible number , and an angle is constructible if and only if its cosine is a ...
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
The block-stacking problem is the following puzzle: Place N {\displaystyle N} identical rigid rectangular blocks in a stable stack on a table edge in such a way as to maximize the overhang. Paterson et al. (2007) provide a long list of references on this problem going back to mechanics texts from the middle of the 19th century.
Mathematically, shape optimization can be posed as the problem of finding a bounded set, minimizing a functional (),possibly subject to a constraint of the form =Usually we are interested in sets which are Lipschitz or C 1 boundary and consist of finitely many components, which is a way of saying that we would like to find a rather pleasing shape as a solution, not some jumble of rough bits ...
This question, which is also known as Dürer's conjecture, or Dürer's unfolding problem, remains unanswered. [ 9 ] [ 10 ] [ 11 ] There exist non-convex polyhedra that do not have nets, and it is possible to subdivide the faces of every convex polyhedron (for instance along a cut locus ) so that the set of subdivided faces has a net. [ 5 ]
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
The problem of two fixed centers conserves energy; in other words, the total energy is a constant of motion.The potential energy is given by =where represents the particle's position, and and are the distances between the particle and the centers of force; and are constants that measure the strength of the first and second forces, respectively.