MATH 2331

Chapter 1 Answers to even-numbered homework problems

Section 1-1:

#10. x = −9, y = 5, z = 0

0.1b  1000  a  a  0.1b  1000

#24.  or 
0.2a  780  b  0.2a  b  780

a  b  c  1

#36. a  3b  9c  3 The system is inconsistent.
 b  4c  3


Section 1-2:

#2. No solution

#4. x = 2, y = − 1

#18. (a) No (b) Yes (c) No (d) Yes

0 0 1 k  0 1  1 0
#22.   ,   ,  ,   . 4 types
0 0 0 0 0 0 0 1

0 0 0 1 a b  0 1 k  0 0 1  0 1 0
#24.   ,  ,   ,  ,  ,
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

1 0 d  1 e 0 
0 1 e  , 0 0 1 . 7 types
   

 a 1
 a  b c d 0

#32.  ; f ( t )  1  2t  t 2  2t 3
 a b c d 0
 a  2b  4 c  8d  15

x  3 1 
#36. The vectors are of the form  y   s   1   t  0 ,
   
 z   0  1 

where s and t are any real numbers.

Section 1-3:

#2. rank = 3

#4. rank = 2

   
#6. No solution, since any linear combination x v1  y v 2 of v1 and v 2 will be
 
parallel to v1 and v 2 .


#8. Infinitely many solutions. There are at least two obvious solutions. Write v 4 as
  
a linear combinations of v1 and v 2 alone or as a linear combination of v3 and

v 2 alone. Therefore, this linear system has infinitely many solutions.

#10. “dot product” ; 0.

#12. 70

 6
#14.  
8 

1 0 0
#22. 0 1 0
 
0 0 1

1 0 0 0
0 1 0 0
#24. rref(A) =  
0 0 1 0
 
0 0 0 1

1 0 0
0 1 0
#26. rank (A) = 3 ; rref(A) =   .
0 0 1
 
0 0 0

 
Since all variables are leading, the system A x  c cannot have infinitely many
 
solutions, but it could have a unique solution (e.g., c  b ) or no solution at all.
 1 0 0
0 1 0
 
#28. There must be a leading 1 in each column; rref(A) = 0 0 1 .
 
0 0 0
0 0 0

 a b c   5  2
#30.  d e f    3   0 . Thus 5a  3b  9c  2 , 5d  33  9 f  0 , and
     
 g h i    9 1 

5g  3h  9i  1 . One way to force our matrix to have rank 1 is to make all the
entries in the 2nd and 3rd columns zero. That means, 5a  2 , 5d  0 , and
5g  1 .

2 
 5 0 0
2 1  
Therefore, a  , d  0 , and g  . Thus, one possible matrix is 0 0 0  .
5 5
1 
 0 0
5 

a  b  c 
  
#34. (a) A e1  d , A e2  e , A e3   f 
   
     
 g  h  k 

     
(b) B e1  v1 , B e2  v 2 , B e3  v 3

1 4 7 
#36. A  2 5 8
 
3 6 9