Constructible polygonIn mathematics, a constructible polygon is a regular polygon that can be constructed with compass and straightedge. For example, a regular pentagon is constructible with compass and straightedge while a regular heptagon is not. There are infinitely many constructible polygons, but only 31 with an odd number of sides are known. Some regular polygons are easy to construct with compass and straightedge; others are not.
Pierpont primeIn number theory, a Pierpont prime is a prime number of the form for some nonnegative integers u and v. That is, they are the prime numbers p for which p − 1 is 3-smooth. They are named after the mathematician James Pierpont, who used them to characterize the regular polygons that can be constructed using conic sections. The same characterization applies to polygons that can be constructed using ruler, compass, and angle trisector, or using paper folding. Except for 2 and the Fermat primes, every Pierpont prime must be 1 modulo 6.
Neusis constructionIn geometry, the neusis (νεῦσις; ; plural: neuseis) is a geometric construction method that was used in antiquity by Greek mathematicians. The neusis construction consists of fitting a line element of given length (a) in between two given lines (l and m), in such a way that the line element, or its extension, passes through a given point P. That is, one end of the line element has to lie on l, the other end on m, while the line element is "inclined" towards P.
Mathematics of paper foldingThe discipline of origami or paper folding has received a considerable amount of mathematical study. Fields of interest include a given paper model's flat-foldability (whether the model can be flattened without damaging it), and the use of paper folds to solve up-to cubic mathematical equations. Computational origami is a recent branch of computer science that is concerned with studying algorithms that solve paper-folding problems.
Euclidean planeIn mathematics, a Euclidean plane is a Euclidean space of dimension two, denoted E2. It is a geometric space in which two real numbers are required to determine the position of each point. It is an affine space, which includes in particular the concept of parallel lines. It has also metrical properties induced by a distance, which allows to define circles, and angle measurement. A Euclidean plane with a chosen Cartesian coordinate system is called a Cartesian plane.
Angle trisectionAngle trisection is a classical problem of straightedge and compass construction of ancient Greek mathematics. It concerns construction of an angle equal to one third of a given arbitrary angle, using only two tools: an unmarked straightedge and a compass. In 1837, Pierre Wantzel proved that the problem, as stated, is impossible to solve for arbitrary angles. However, some special angles can be trisected: for example, it is trivial to trisect a right angle (that is, to construct an angle of 30 degrees).
TetradecagonIn geometry, a tetradecagon or tetrakaidecagon or 14-gon is a fourteen-sided polygon. A regular tetradecagon has Schläfli symbol {14} and can be constructed as a quasiregular truncated heptagon, t{7}, which alternates two types of edges. The area of a regular tetradecagon of side length a is given by As 14 = 2 × 7, a regular tetradecagon cannot be constructed using a compass and straightedge. However, it is constructible using neusis with use of the angle trisector, or with a marked ruler, as shown in the following two examples.
Constructible numberIn 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. Equivalently, is constructible if and only if there is a closed-form expression for using only integers and the operations for addition, subtraction, multiplication, division, and square roots. The geometric definition of constructible numbers motivates a corresponding definition of constructible points, which can again be described either geometrically or algebraically.
Casus irreducibilisIn algebra, casus irreducibilis (Latin for "the irreducible case") is one of the cases that may arise in solving polynomials of degree 3 or higher with integer coefficients algebraically (as opposed to numerically), i.e., by obtaining roots that are expressed with radicals. It shows that many algebraic numbers are real-valued but cannot be expressed in radicals without introducing complex numbers. The most notable occurrence of casus irreducibilis is in the case of cubic polynomials that have three real roots, which was proven by Pierre Wantzel in 1843.
CircumcircleIn geometry, the circumscribed circle or circumcircle of a triangle is a circle that passes through all three vertices. The center of this circle is called the circumcenter of the triangle, and its radius is called the circumradius. The circumcenter is the point of intersection between the three perpendicular bisectors of the triangle's sides, and is a triangle center. More generally, an n-sided polygon with all its vertices on the same circle, also called the circumscribed circle, is called a cyclic polygon, or in the special case n = 4, a cyclic quadrilateral.
