Trisecting the angle in the context of "Straightedge and compass construction"

Play Trivia Questions online!

or

Skip to study material about Trisecting the angle in the context of "Straightedge and compass construction"




⭐ Core Definition: Trisecting the angle

Angle trisection is the construction of an angle equal to one third of a given arbitrary angle, using only two tools: an unmarked straightedge and a compass. It is a classical problem of straightedge and compass construction of ancient Greek mathematics.

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.

↓ Menu

In this Dossier

Trisecting the angle in the context of Doubling the cube

Doubling the cube, also known as the Delian problem, is an ancient 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. As with the related problems of squaring the circle and trisecting the angle, doubling the cube is now known to be impossible to construct by using only a compass and straightedge, but even in ancient times solutions were known that employed other methods.

According to Eutocius, Archytas was the first to solve the problem of doubling the cube (the so-called Delian problem) with an ingenious geometric construction. The nonexistence of a compass-and-straightedge solution was finally proven by Pierre Wantzel in 1837.

↑ Return to Menu

Trisecting the angle in the context of Pierre Wantzel

Pierre Laurent Wantzel (5 June 1814 – 21 May 1848) was a French mathematician who proved that several ancient geometric problems were impossible to solve using only compass and straightedge.

In a paper from 1837, Wantzel proved that the problems of doubling the cube and trisecting the angle are impossible to solve if one uses only a compass and straightedge. In the same paper he also solved the problem of determining which regular polygons are constructible: a regular polygon is constructible if and only if the number of its sides is the product of a power of two and any number of distinct Fermat primes (i.e., the sufficient conditions given by Carl Friedrich Gauss are also necessary).

↑ Return to Menu