Questions: Ruler and Compass Constructions (Algebraic Proof)

5 questions to test your understanding

Score: 0 / 5
Question 1 Multiple Choice

A student claims that angle trisection is merely very difficult — that a sufficiently clever construction sequence could succeed where all previous attempts have failed. The algebraic proof in this topic establishes that:

ACurrent construction methods are inefficient but not impossible; better algorithms could in principle work
BTrisecting 60° requires constructing cos(20°), whose minimal polynomial over Q is an irreducible cubic of degree 3 — since 3 is not a power of 2, this is provably impossible, not merely unachieved
CTrisection is impossible only for 60°; other angles could be trisected with the right approach
DThe impossibility is geometric rather than algebraic; new geometric axioms could in principle allow trisection
Question 2 Multiple Choice

Why does the transcendence of π immediately imply that squaring the circle is impossible, even before applying the power-of-2 degree criterion?

Aπ is irrational, and ruler-and-compass constructions can only produce rational lengths
Bπ is transcendental — it satisfies no polynomial with rational coefficients — so it cannot appear in any algebraic extension of Q at all, including any tower of quadratic extensions
Cπ is larger than all constructible numbers, which are bounded by the initial unit length
DSquaring the circle requires the ratio π to appear as a coefficient, and coefficients must be constructible
Question 3 True / False

A real number is constructible by ruler and compass if and only if it lies in a tower of quadratic field extensions over Q, meaning its degree over Q must be a power of 2.

TTrue
FFalse
Question 4 True / False

The cube root of 2 is not constructible because it is irrational — ruler-and-compass constructions cannot produce irrational lengths.

TTrue
FFalse
Question 5 Short Answer

Explain why each step of a ruler-and-compass construction extends the current field by at most a degree-2 extension, and why this implies any constructible number's minimal polynomial degree must be a power of 2.

Think about your answer, then reveal below.