Virtual laboratory/Mathematics/Geometry/Compass-and-straightedge constructions

Compass-and-straightedge constructions

An extension of the topic of geometric constructions. With compass and straightedge we construct only numbers obtained through arithmetic operations and square roots. Some constructions are feasible (dividing a segment, √n, the regular 17-gon — Gauss 1796), and some have been proved impossible (trisecting an arbitrary angle, doubling the cube — Wantzel 1837).

Compass-and-straightedge constructions
Mathematics · Geometry · Compass-and-straightedge constructions (1837)
Construction task:
Trisecting (dividing into 3 equal parts) an arbitrary angle with compass and straightedge is…
task
Dividing a segm…
status
FEASIBLE
needs
Thales’ thm
verdict
classic
🎯 Challenge: feasible or impossible?
streak: 0

I’ll give you a construction task — decide whether it can be done with compass and straightedge. Only +, −, ×, ÷ and √ are available.

What just happened?

The compass and straightedge (unmarked) are the classical tools of Greek geometry — but not everything can be constructed with them. Some famous constructions are feasible, while others — despite attempts spanning millennia — turned out to be impossible, which was only proved in the 19th century.

Which lengths are constructible?

Mathematically: the lengths constructible with compass and straightedge are exactly those obtainable from a unit segment by addition, subtraction, multiplication, division and square roots:

1  →  +, −, ×, ÷,      constructible numbers1 \;\xrightarrow{\;+,\,-,\,\times,\,\div,\,\sqrt{\ }\;}\; \text{constructible numbers}

So the feasible ones include: dividing a segment into any number of equal parts (Thales’ theorem), constructing n\sqrt{n} (as a geometric mean), bisecting an angle, and regular polygons with a suitable number of sides.

Gauss’s breakthrough (1796):

The young Carl Gauss proved that the regular 17-gon is constructible — unknown since antiquity. In general a regular nn-gon is constructible when nn is a product of a power of two and distinct Fermat primes. Gauss thus gave the full condition for the constructibility of regular polygons.

What was proved to be IMPOSSIBLE:

Some constructions require numbers that cannot be obtained with square roots alone — e.g. 23\sqrt[3]{2} requires a cube root. That is why the following are impossible:

  • Trisecting (dividing into 3 equal parts) an arbitrary angle — Pierre Wantzel, 1837
  • Doubling the cube (constructing the side of a cube of double volume, i.e. 23\sqrt[3]{2}) — Pierre Wantzel, 1837
  • Squaring the circle — Ferdinand Lindemann, 1882
23 ∉ {constructible numbers}(a cube root is needed)\sqrt[3]{2}\ \notin\ \{\text{constructible numbers}\} \quad(\text{a cube root is needed})

The invariant:

Only numbers obtainable from one by arithmetic operations (+,−,×,÷+,-,\times,\div) and square roots ( \sqrt{\ }) are constructible with compass and straightedge — not, for example, a cube root.

Why this matters for the exam:

This story shows the power of algebra: purely geometric questions (“can it be drawn?”) are settled by number theory and the theory of algebraic fields, turning “we cannot” into “it has been proved impossible”. Remember the criterion — only arithmetic operations and the square root are available.

Remember: with compass and straightedge you can construct what arises from 1 by +,−,×,÷+,-,\times,\div and  \sqrt{\ }. Dividing a segment, n\sqrt{n} and the 17-gon — yes; trisecting an angle and doubling the cube (23\sqrt[3]{2}) — proved impossible.

Illustrative model · NexTutor Virtual laboratory

Enjoyed the experiment? Share it.

It's free — send it to friends from school.

Theory & formulas

What is constructible

From a unit segment, with compass and straightedge, we obtain numbers reached through +,−,⋅,÷+,-,\cdot,\div and square roots  \sqrt{\ } (the "quadratically constructible" numbers).

What has been proved impossible

  • trisecting an arbitrary angle — leads to a degree-33 equation,
  • doubling the cube — requires 23\sqrt[3]{2}.

This was shown by Wantzel (1837).

Regular polygons

Gauss (1796): a regular nn-gon is constructible, among others, when nn is a product of a power of 22 and distinct Fermat primes — hence the constructible 1717-gon.

Notation: nn the number of sides, 23\sqrt[3]{2} the cube root of 22.

Frequently asked questions

›

Is trisecting an arbitrary angle with compass and straightedge possible?

No — Pierre Wantzel proved this in 1837.

›

Which numbers are constructible with compass and straightedge?

Only those obtained from one through arithmetic operations and square roots (not, for example, a cube root).

›

What did Gauss discover about constructions?

That the regular 17-gon is constructible (1796) — and he gave the general condition for the constructibility of regular polygons.

Teaching? Embed this experiment on your site.

Free widget — paste it on your school site, blog or notes. It links to the full version.

Teaching a class or tutoring? Guide students in NexTutor →