Name: Student Number:

Problem 1 (5 points). The Fibonacci sequence Fn is defined by F0 = 0, F1 = 1 and

Fn = Fn−1 +Fn−2 for all n ≥ 2. The first few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, . . .
Let
 
1 1
A= .
1 0
Use induction to prove that
 
n Fn+1 Fn
A =
Fn Fn−1
for all n ≥ 1.
 Name: Student Number:
Problem 2 (5 points). Let L1 be the line in R3 through the points
   
2 1
P = 9  and Q =  7 .
−9 −6
Let L2 be the line in R3 with parametric equations
x = 7 + 2t
y = −1 − t
z = 4 + t.
(See Chapter 4.1 of the textbook.)
(a) Find parametric equations of the line L1 .
(b) Determine if L1 and L2 intersect. If so, find their intersection point S.
 Name: Student Number:
Problem 3 (5 points). Consider the following directed graph D:

v1 v2

v3

(See Chapter 2.3 of the textbook.)

(a) Find the adjacency matrix A of D.
(b) Compute A3 . How many paths of length three are there that start in v2 ? How many
paths of length three are there that end in v2 ?
 Name: Student Number:
Problem 4 (5 points). A linear map f : R2 → R2 is called isometry if ||f (v)|| = ||v||
for all v ∈ R2 .
Let Rθ : R2 → R2 denote counterclockwise rotation about the origin through the
angle θ. Use the matrix of Rθ to show that Rθ is an isometry.
(Hint: (sin θ)2 + (cos θ)2 = 1.)