Math 361, Spring 2017, Assignment 11
From cartan.math.umb.edu
Carefully define the following terms, then give one example and one non-example of each:[edit]
- Compass-and-straightedge construction.
- Constructible number.
Carefully state the following theorems (you do not need to prove them):[edit]
- Theorem concerning sums, differences, products, and inverses of constructible numbers.
- Theorem concerning square roots of constructible numbers.
- Theorem concerning the degrees of constructible numbers over Q.
- Theorem concerning duplication of the cube.
- Theorem concerning squaring the circle.
Describe the following compass-and-straightedge constructions:[edit]
- Perpendicular bisector.
- Dropping a perpendicular.
- Constructing a parallel.
- Multiplication of lengths.
- Inversion of length.
- Square root of length.
Solve the following problems:[edit]
- Determine whether the following numbers are constructible:
- (a) √5−14.
- (b) 6√7.
- (c) α where α is a root of the polynomial x3+3x−12. (Hint: use Eisenstein's criterion.)
Questions[edit]
A) √(5)−14
α=√(5)−14
4α=√(5)−1
4α+1=√(5)
(4α+1)2=√(5)2
16α2+8α+1=5
16α2+8α+4=0
Therefore because the problem is of degree two it is constructible. Is my reasoning totally off?
- Yes and no. We've proved that constructible numbers have degree a power of two, but not that numbers with degree a power of two are constructible. However, we know that the field of constructible numbers contains Q and is closed under square roots. So it contains √5,1, and 4, and is closed under addition, subtraction, multiplication, and division, so it contains √5−14. -Steven.Jackson (talk) 09:40, 17 April 2017 (EDT)
The Eisenstein's criterion: Can be applied like this:
8x3+6x2−9x+24 where p=3 because 32=9 and does not go into 24 evenly therefore the equation is irreducibility.
C)x3+3x−12 where p=3 because 32=9 and does not go into 12 evenly therefore the equation is irreducibility. How does this help us determine weather the following is constructible or not?
- This shows that x3+3x−12 is really the minimal polynomial of α, and thus that α has degree three over the rationals. Since three is not a power of two, it follows that α is not constructible. -Steven.Jackson (talk) 09:40, 17 April 2017 (EDT)