To receive notifications about scheduled maintenance, please subscribe to the mailing-list You can subscribe to the mailing-list at

Unverified Commit a58f7cf9 authored by rrueger's avatar rrueger
Browse files

Algebra II: Lecture 9. Cleanup

parent bad3a974
......@@ -43,12 +43,6 @@ We have seen that $\F _{p^n} / \F _p$ and $\C (X_1, \ldots, X_n) / \C (e_1,
carefully the constructibility of $n$-gons, that is regular polygons with n
% \begin{siderules}
% The story of constructibility begins on the sun kissed beaches of icarus...
% @todo
% Finish the story.
% \end{siderules}
We will now reason a series of reductions on what it means for a number to be
constructible prove one direction of Theorem~\ref{thm:gauss-wantzel}
(Gauss-Wantzel). We will show that if an $n$-gon is constructible, then $n$ is
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment