Examination problems
I conclude this book by a list of exercises and problems that students were really asked to solve for exams. Some of them are quite substantial. Exercise 7.1 proves a theorem of Selmer which shows that for any inte- ger n 2, the polynomial Xn − X − 1 is irreducible over Q. Exercise 7.2 is an elaboration on the casus irreductibilis: it explains and generalizes the fact that although the three roots of a polynomial equation of degree 3 might be real numbers, Cardan’s formulae use complex numbers. Exercise 7.5 is a theorem due to Galois about solvability by radicals of equations of prime degree. Exercise 7.11 proves a theorem due to E. Artin and O. Schreier about subfields F of an algebraically closed field Ω such that [Ω : F ] is finite.
Exercise 7.1. Let n be any integer 2, and let S = Xn − X − 1. You shall show, following E. Selmer1,thatS is irreducible in Z[X]. a) Show that S has n distinct roots in C. b) For any polyomial P ∈ C[X]suchthatP (0) = 0, set