KOÇ UNIVERSITY FALL 2022

MATH 107, FIRST MIDTERM EXAM

Duration of Exam: 90 minutes

IN THIS EXAM, you are not allowed to use any material from chapters 3, 4 or 5.

You can NOT use calculators in the exam.

No books, no notes, no cheat sheet, no questions and no talking allowed.

You must always explain your answers and show your work to receive full credit.

Print (use CAPITAL LETTERS) and sign your name below.

Name: —————————————————

Surname: —————————————————

Signature: ————————————————————

PROBLEM POINTS SCORE

1 25
2 20
3 20
4 20
5 15
TOTAL 100

1
PROBLEM 1 (25 points): Let
 
  2  
1 2 −1 −3  5  8
A=  0 0 1 5  and b =   and c = 6 
  
1
0 0 0 7 7
1
(a) (5 points) Is the vector b a solution of the linear system Ax = 2c? Explain your answer.
(b) (5 points) Use row-reduction to obtain the reduced echelon form of A. You need to show step
by step each elementary row operation you apply.
(c) (5 points) Write down the general solution of the system Ax = 0, in parametric form.
(d) (5 points) Write down the general solution of the system Ax = c, in parametric form.
(e) (5 points) Write down the general solution of the system 3Ax = 7c, in parametric form.
.
PROBLEM 2 (20 points) : Consider the vectors
     
1 0 −3
u =  −1  v =  1  w =  6 
2 2 0
 
3k
(a) (10 points) Find all the values of k ∈ R such that a =  11  belongs to Span {u, v, w}.
k
(b) (10 points) Let A be the matrix whose columns are the vectors u, v, w. Consider the linear
transformation
 T : R3 → R3 defined as T (x) = Ax. If it is possible, find a vector b ∈ R3 such that

−6
T (3b) =  11 ? Explain your answer.
−2
.
PROBLEM 3 (20 points) : Consider the linear transformation T : R3 → R3 given by
   
x1 x1 + x2 + x3
T ( x2 ) =  x1 + 2x2 + 2x3  .
x3 x1 + 2x2 + 3x3
     
1 0 0
(a) (5 points) Compute T ( 0 ) and T ( 1 ) and T ( 1 ).
0 0 0
(b) (5 points) Write the standard matrix for the linear transformation T .
(c) (5 points) Is T onto? Give a reason for your answer.
(d) (5 points) Is T one-to-one? Give a reason for your answer.
PROBLEM 4 (20 points): Consider the matrix
 
1 0 r
D =  −3 1 0 
3 1 1
(a) (10 points) Find all the values of r in R such that the matrix D is invertible.
(a) (5 points) Substitute r = 0 in the matrix D above, and compute D−1 if D is invertible.
(c) (5 points) Substitute r = 0 in the matrix D above, consider the linear transformation T : R3 →
R given by T (x) = Dx. Compute T −1 (2x) for any vector x ∈ R3 .
3
.
PROBLEM 5 (15 points) : Mark each statement as True or False, by writing T or F inside the box
to the left of each statement. No explanation is needed in this question.

(a) Two matrices are row equivalent if they have the same number of rows.

(b) If one row in an echelon form of an augmented matrix is [0 0 0 5 0], then the associated linear
system is inconsistent.

(c) The solution set of the linear system whose augmented matrix is [a1 a2 a3 b] is the same as
the solution set of the equation x1 a1 + x2 a2 + x3 a3 = b.

(d) A vector b is a linear combination of the columns of a matrix A if and only if the equation
Ax = b has at least one solution.

(e) If the equation Ax = b is inconsistent, then b is not in the set spanned by the columns of A.

(f) The equation Ax = b is homogeneous if the zero vector is a solution.

(g) If v1 , v2 , v3 , v4 are in R4 and v3 is not a linear combination of v1 , v2 , v4 then {v1 , v2 , v3 , v4 }

is linearly independent.

(h) If v1 , v2 , v3 , v4 are in R4 and {v1 , v2 , v3 } is linearly dependent, then {v1 , v2 , v3 , v4 } is also

linearly dependent.

(i) Every linear transformation from Rn to Rm is a matrix transformation.

(j) If A is a 9 × 8 matrix, then the transformation x → Ax cannot be one-to-one.

(j) If A is a 8 × 7 matrix, then the transformation x → Ax cannot be onto.

(k) The transpose of a sum of matrices equals the sum of their transposes.

(l) If A and B are n × n and invertible, then A−1 B −1 is the inverse of AB.

(m) If there is a b in Rn such that the equation Ax = b is inconsistent, then the transformation
x → Ax is not one- to-one.
1
(n) Suppose that A is an n × n matrix. If the equation Ax = 0 has a nontrivial solution, then A
has less than n pivot positions.