Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 1.3.14
Exercise 1.3.14
In Section 1.1, we discussed the equation considered by Fibonacci.
- (a)
- Show that this equation has precisely one real root. This is the root Fibonacci approximated so well.
- (b)
- Use Cardan’s formulas and a calculator to work out numerically the three roots of this polynomial.
Answers
Proof.
- (a)
-
Let
.
For all , , thus is strictly increasing, is continuous, and , . By the intermediate values theorem, is a bijection. Therefore there exists such that , so there exists a unique real root of
As and , this root is positive.
- (b)
-
To remove the coefficient of
, let
.
Define by
Consequently, the real solution of the equation is given by
With a calculator, an approximation at of the real root is .
The two other roots are given by
To verify the Fibonacci’s result in 1225, we compute a decomposition of with basis 60 with the following Maple program (or Sage program):
x1:=1/3*(-2+(6*sqrt(3930)+352)^(1/3)-(6*sqrt(3930)-352)^(1/3)): l:=[1]:Digits:=20: u:=evalf(x1): u:=u-1: for i to 6 do a:=floor(60*u):u:=60*(u-a/60.0):l:=l,a: od: [l]; [[1], 22, 7, 42, 33, 4, 38]
which gives
Only the last fraction is slightly different in Fibonacci’s result , the difference being .
Idem with Sage :
x1 = 1/3*((6*sqrt(3930) + 352)^(1/3) - (6*sqrt(3930) - 352)^(1/3) - 2) R = RealField(200) u = R(x1) n = floor(u) l = [[n]]; u = u-n for i in range(6): a = floor(60*u) u = 60*(u-a/60) l.append(a) print l [[1], 22, 7, 42, 33, 4, 38]
□