MATH4333 Solution to Homework 2

1. Starting with
2 1 as the first rational approximation, find the next three rational approxi-
mations to 2 using
a continued fraction expansion. For comparison,
find the first three rational
approximations to 2 using Newtons method for root-finding with 2 1 as the initial guess.
Solution

(a) Continued fraction expansion of 2:

i 1/Ri1 ni ci Ri | 2 ci |
1 1.4142135624 1 1 0.4142135624 0.4142135624
2 2.4142135624 2 3/2 0.4142135624 0.0857864376
3 2.4142135624 2 7/5 0.4142135624 0.0142135624
4 2.4142135624 2 17/12 0.4142135624 0.0024531043
(b) Newtons method for finding root of f (x) = x2 2:
x2 2
i xi1 xi = xi1 2x
i1
i1
| 2 xi |
1 1 0.4142135624
2 1 3/2 0.0857864376
3 3/2 17/12 0.0024531043
4 17/12 577/408 0.0000021239

The results in Newtons method converges faster than those in continued fraction expansion.
2. Solve the Fibonacci equations
    
u1,n+1 0 1 u1,n
=
u2,n+1 1 1 u2,n

by finding all the eigenvalues and corresponding eigenvectors, and satisfying the initial conditions.
Solution
Consider the characteristic equation
 
0 1
det = 2 1 = 0
1 1

1+ 5 1 5
The eigenvalues are 1 = 2 and 2 = 2 , the corresponding eigenvectors are
   
1 1
~v1 = 1+ 5 ~v2 = 1 5
2 2
   
(1) u1,1 1
Let ~u = = , solving the equation ~u(1) = a1~v1 + a2~v2 yields
u2,1 1

5+1 1 51 1
a1 = = 1 AND a2 = = 2
2 5 5 2 5 5
So for any integer n > 1,
   n1
u1,n 0 1 1
~u(n) = = ~u(1) = (n1 ~v1 n2 ~v1 )
u2,n 1 1 5
Hence the n-th Fibonacci number is
" !n !n #
1 1 1+ 5 1 5
u1,n = (n1 n2 ) =
5 5 2 2

1
3. With the Fibonacci numbers defined as
an+1 = an + an1 , a1 = a2 = 1,
10
find the smallest value of n such that an > 10 .
Solution
In order to estimate the value of n, consider the solution in Question 2:
" !n !n # !n
1 1+ 5 1 5 1 1+ 5
un = when n 1
5 2 2 5 2

So,
!n

1 1+ 5 log 5 1010
> 1010 = n>   = 49.52
5 2 log 1+2 5
Check that u49 = 7778742049 < 1010 and u50 = 12586269025 > 1010 , so n = 50 is the smallest
value of n that an > 1010 .
4. Let L be the Leslie matrix. Show by direct calculation that the characteristic equation det(LI) =
0 is given by
f1 1 f2 2 f = 0
Solution
 
 m1 s1 m2 s1 m3 s1 m1 s1 m s1 
 

 s2 0 0 0 

det(I L) = 
 0 s 3 0 0 

 .. .. .. .. .. .. 

 . . . . . . 

 0 0 0 s 
   
 0 0 0  m2 s1 m3 s1 m1 s1 m s1 
   
 s3 0 0  s3 0 0 
   
=( m1 s1 )  0 s4 0 0 0 s 0 0
   
 + s2  4 
 .. .. .. .. ..
  .. .. .. .. .. 
 . . . . .
  . . . . . 
   
 0 0 s   0 0 s 
   
 0 0   m3 s1 m4 s1 m s1 
  
 s4 0   s4 0 
  
1
+ s2 m2 s1  0 s5 0  + s3  0 s5 0
 
=( m1 s1 ) 
 .. .. .. ..   .. .. .. .. 
 . . . .    . . . . 
  
 0 0   0 0 
 
 0 0 

 s5 0 

1 2  0 s6 0 
= m1 s1 m2 s 1 s 2 + s2 s3 m3 s1 
 .. .. .. .. 
 . . . . 

 0 0 
 
 m4 s1 m5 s1 m s1 
 
 s5 0 
 

+ s4  0 s 6 0 

 .. .. .. .. 

 . . . . 

 0 0 
.
(inductively)..
= m1 s1 1 m2 s1 s2 2 m3 s1 s2 s3 3 m s1 s2 s
= f1 1 f2 2 f3 3 f

2
 So,

det(L I) = 0 det(I L) = 0 f1 1 f2 2 f3 3 f = 0

5. Prove that if f (a) is a continuous non-negative function, then the Euler-Lotka equation,
Z
f (a)era da = 1,
0

has exactly one real root for r, and that this real root is larger than the real part of any complex
root.
Solution
Since there is no solution for the Euler-Lotka equation if f 0, assume f (a) is a continuous
non-negative function and f > 0 on some interval I (0, ).
R
(a) Define F (r) = 0 f (a)era da 1, then F (r) is a continuous strictly decreasing function since
Z Z
F (r) = a
|{z} f (a) e ra
|{z} da ra
a f (a) e|{z}
|{z} da < 0
0 |{z} I |{z}
>0 0 >0 >0 >0 >0

Furthermore,
lim F (r) = + AND lim F (r) = 1
r r+

By Intermediate Value Theorem, there is some real number r that F (r ) = 0 and this real
root is unique by the monotonicity of F (r).
(b) Suppose z = x + iy is a complex root of F (r), then
Z Z
F (z) = f (a)e(x+iy)a da 1 = 0 f (a)exa [cos(ya) + i sin(ya)]da = 1
0
Z0
f (a)exa cos(ya)da = 1
0

By the fact that cos(ya) < 1 almost everywhere in (0, ),

Z Z
1= f (a)exa cos(ya)da < f (a)exa da = F (x) + 1 F (x) > 0 = F (r )
0 0

Since F (r) is strictly decreasing, F (x) > F (r ) x < r, so r is larger than the real part
of any complex root.
6. Consider a population of annual plants with the following characteristics. Seeds are produced at
the end of the summer. A proportion survive one winter, and a proportion of these germinate the
following spring. Of the remainder, a proportion survive a second winter, and a proportion of these
germinate the spring following this second winter, but none can germinate later than this.
(a) Justify the model
Nn+2 = Nn+1 + (1 ) 2 Nn .
for the population, and interpret the parameters biologically.
(b) Write this in terms of a Leslie matrix.
(c) Use an eigenvalue equation to show that the condition for the plant population to thrive is
1
>
+ (1 ) 2

(d) Show that this condition is equivalent to the condition R0 > 1, where R0 is the basic repro-
ductive ratio, interpreted here to be the expected number of plants produced by a mother
plant, that in turn produce their own seeds.

3
Solution

(a) The factor is the potential per capita reproduction of offspring, taking into account all
factors but over-winter survival and germination. is the probability of surviving the winter,
is the fraction of one-winter survivors that germinate and is the fraction of two-winter
survivors that germinates.
(b) Denote at year n, Sn the population of surviving seeds and Nn the population of grown plants,
then the matrix equation of the plant population can be written as
    
Sn+1 0 (1 ) Sn
=
Nn+1 Nn

So, the Leslie matrix is  

0 (1 )
L=

(c) Consider the characteristic equation
 
(1 )
det = 2 (1 ) 2 = 0


2 2 2 +4(1)2
The eigenvalues are = 2 0. The plant population thrives when
the positive eigenvalue + > 1, that is
p
+ 2 2 2 + 4(1 ) 2 > 2
p
2 2 2 + 4(1 ) 2 > 2
2 2 2 + 4(1 ) 2 > (2 )2 = 4 4 + 2 2 2
(1 ) 2 > 1
1
>
+ (1 ) 2

(d) Since R0 = + (1 ) 2 ,
1
> R0 > 1
+ (1 ) 2