Ad
related to: construction math problems
Search results
Results From The WOW.Com Content Network
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 ...
Doubling the cube, also known as the Delian problem, is an ancient [a] [1]: 9 geometric problem. Given the edge of a cube , the problem requires the construction of the edge of a second cube whose volume is double that of the first.
Squaring the circle is a problem in geometry first proposed in Greek mathematics.It is the challenge of constructing a square with the area of a given circle by using only a finite number of steps with a compass and straightedge.
Geometric Constructions is a mathematics textbook on constructible numbers, and more generally on using abstract algebra to model the sets of points that can be created through certain types of geometric construction, and using Galois theory to prove limits on the constructions that can be performed.
The square root of 2 is equal to the length of the hypotenuse of a right triangle with legs of length 1 and is therefore a constructible number. In geometry and algebra, a real number is constructible if and only if, given a line segment of unit length, a line segment of length | | can be constructed with compass and straightedge in a finite number of steps.
In order to reduce a geometric problem to a problem of pure number theory, the proof uses the fact that a regular n-gon is constructible if and only if the cosine (/) is a constructible number—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots.
Euclidean geometry is a mathematical system attributed to ancient Greek mathematician Euclid, which he described in his textbook on geometry, Elements.Euclid's approach consists in assuming a small set of intuitively appealing axioms (postulates) and deducing many other propositions from these.
The construction of origami models is sometimes shown as crease patterns. The major question about such crease patterns is whether a given crease pattern can be folded to a flat model, and if so, how to fold them; this is an NP-complete problem. [32] Related problems when the creases are orthogonal are called map folding problems.