Solution Manual + Answer Key

Solution Manual for Elementary Linear Algebra 8th Edition by Ron

Larson

View Full Product:

https://selldocx.com/products/solution-manual-elementary-linear-algebra-8e-lar

Book Title: Elementary Linear Algebra

Edition: 8th Edition

Author: Ron Larson

Click above to view a sample

 Complete Solutions Manual
to Accompany

Elementary Linear Algebra

EIGHTH EDITION

Ron Larson
© Cengage Learning. All rights reserved. No distribution allowed without express authorization.

The Pennsylvania State University,

State College, PA

Australia • Brazil • Mexico • Singapore • United Kingdom • United States

 © 2017 Cengage Learning ISBN-13: 978-13056580-35
ISBN-10: 0-130565803-5
ALL RIGHTS RESERVED. No part of this work covered by the
copyright herein may be reproduced, transmitted, stored, or Cengage Learning
used in any form or by any means graphic, electronic, or 200 First Stamford Place, 4th Floor
mechanical, including but not limited to photocopying, Stamford, CT 06902
recording, scanning, digitizing, taping, Web distribution, USA
information networks, or information storage and retrieval
systems, except as permitted under Section 107 or 108 of the Cengage Learning is a leading provider of customized
1976 United States Copyright Act, without the prior written learning solutions with office locations around the globe,
permission of the publisher except as may be permitted by the including Singapore, the United Kingdom, Australia,
license terms below. Mexico, Brazil, and Japan. Locate your local office at:
www.cengage.com/global.

Cengage Learning products are represented in

For product information and technology assistance, contact us at Canada by Nelson Education, Ltd.
Cengage Learning Customer & Sales Support,
1-800-354-9706. To learn more about Cengage Learning Solutions,
visit www.cengage.com.
For permission to use material from this text or product, submit
all requests online at www.cengage.com/permissions Purchase any of our products at your local college
Further permissions questions can be emailed to store or at our preferred online store
[email protected].
www.cengagebrain.com.

NOTE: UNDER NO CIRCUMSTANCES MAY THIS MATERIAL OR ANY PORTION THEREOF BE SOLD, LICENSED, AUCTIONED,
OR OTHERWISE REDISTRIBUTED EXCEPT AS MAY BE PERMITTED BY THE LICENSE TERMS HEREIN.

READ IMPORTANT LICENSE INFORMATION

Dear Professor or Other Supplement Recipient: may not copy or distribute any portion of the Supplement to any
third party. You may not sell, license, auction, or otherwise
Cengage Learning has provided you with this product (the redistribute the Supplement in any form. We ask that you take
“Supplement”) for your review and, to the extent that you adopt reasonable steps to protect the Supplement from unauthorized
the associated textbook for use in connection with your course use, reproduction, or distribution. Your use of the Supplement
(the “Course”), you and your students who purchase the indicates your acceptance of the conditions set forth in this
textbook may use the Supplement as described below. Cengage Agreement. If you do not accept these conditions, you must
Learning has established these use limitations in response to return the Supplement unused within 30 days of receipt.
concerns raised by authors, professors, and other users
regarding the pedagogical problems stemming from unlimited All rights (including without limitation, copyrights, patents, and
distribution of Supplements. trade secrets) in the Supplement are and will remain the sole and
exclusive property of Cengage Learning and/or its licensors. The
Cengage Learning hereby grants you a nontransferable license Supplement is furnished by Cengage Learning on an “as is” basis
to use the Supplement in connection with the Course, subject to without any warranties, express or implied. This Agreement will
the following conditions. The Supplement is for your personal, be governed by and construed pursuant to the laws of the State
noncommercial use only and may not be reproduced, posted of New York, without regard to such State’s conflict of law rules.
electronically or distributed, except that portions of the
Supplement may be provided to your students IN PRINT FORM Thank you for your assistance in helping to safeguard the integrity
ONLY in connection with your instruction of the Course, so long of the content contained in this Supplement. We trust you find the
as such students are advised that they Supplement a useful teaching tool.

Printed in the United States of America

1 2 3 4 5 6 7 17 16 15 14 13
 CONTENTS
Chapter 1 Introduction to Systems of Linear Equations........................................ 1

Chapter 2 Matrices ................................................................................................ 29

Chapter 3 Determinants......................................................................................... 76

Chapter 4 Vector Spaces ..................................................................................... 104

Chapter 5 Inner Product Spaces .......................................................................... 154

Chapter 6 Linear Transformations...................................................................... 206

Chapter 7 Eigenvalues and Eigenvectors ........................................................... 244

 C H A P T E R 1
Systems of Linear Equations

Section 1.1 Introduction to Systems of Linear Equations ........................................ 2

Section 1.2 Gaussian Elimination and Gauss-Jordan Elimination .......................... 8

Section 1.3 Applications of Systems of Linear Equations .....................................14

Review Exercises ..........................................................................................................22

Project Solutions ..........................................................................................................27

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
C H A P T E R 1
Systems of Linear Equations
Section 1.1 Introduction to Systems of Linear Equations
2. Because the term xy cannot be rewritten as ax + by for 14. 1
x − 1
y=1
2 3
any real numbers a and b, the equation cannot be written y 4
−2x + y = −4
in the form a1x + a2 y = b. So, this equation is not 4
3
linear in the variables x and y. 3
2
4. Because the terms x 2 and y 2 cannot be rewritten as 1
x
ax + by for any real numbers a and b, the equation −4 −3 −2 4
cannot be written in the form a1x + a2 y = b. So, this −2
−3
equation is not linear in the variables x and y.

6. Because the equation is in the form a1x + a2 y = b, it is The two lines coincide.
linear in the variables x and y. Multiplying the first equation by 2 produces a new first
8. Choosing y as the free variable, let y = t and obtain equation.
x − 2y = 2
3x − 12 t = 9 3
−2 x + 4y = −4
3
3 x = 9 + 12 t
Adding 2 times the first equation to the second equation
x = 3 + 16 t. produces a new second equation.
So, you can describe the solution set as x = 3 + 16 t and x− 2y
3
= 2
y = t , where t is any real number. 0 = 0
Choosing y = t as the free variable, you obtain
10. Choosing x2 and x3 as free variables, let x2 = s and
x = 2t + 2. So, you can describe the solution set as
x3 = t and obtain 12 x1 + 24s − 36t = 12. 3
x = 2t + 2 and y = t , where t is any real number.
x1 + 2 s − 3t = 1 3
x1 = 1 − 2s + 3t.
16. y
4x + 3y = 7
So, you can describe the solution set as
8
x1 = 1 − 2s + 3t , x3 = t , and x2 = s, where s and t
6
are any real number. (−2, 5)

12. y
−x + 2y = 3 −x + 3y = 17 2
4 x
−8 −6 −4 −2
(−1, 1) −2

x − x + 3 y = 17
−3 −2
−2 4x + 3 y = 7
−3 x + 3y = 2
−4
Subtracting the first equation from the second equation
produces a new second equation, 5 x = −10 or x = −2.
x + 3y = 2 So, 4( −2) + 3 y = 7 or y = 5, and the solution is:
−x + 2y = 3 x = −2, y = 5. This is the point where the two lines
Adding the first equation to the second equation intersect.
produces a new second equation, 5 y = 5 or y = 1.
So, x = 2 − 3 y = 2 − 3(1), and the solution is: x = −1,
y = 1. This is the point where the two lines intersect.

2 © 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.1 Introduction to Systems of Linear Equations 3

18. y 22. y

3 6x + 5y = 21 250
0.3x + 0.4y = 68.7
x 0.2x − 0.5y = −27.8
−3 3 6 9 150
−3 100
(6, −3) (101, 96)
−6
x − 5y = 21 x
−9 50 150
− 50

x − 5 y = 21 0.2 x − 0.5 y = −27.8

6 x + 5 y = 21 0.3x + 0.4 y = 68.7
Adding the first equation to the second equation Multiplying the first equation by 40 and the second
produces a new second equation, 7 x = 42 or x = 6. equation by 50 produces new equations.
So, 6 − 5 y = 21 or y = −3, and the solution is: x = 6, 8 x − 20 y = −1112
y = −3. This is the point where the two lines intersect. 15 x + 20 y = 3435

y
Adding the first equation to the second equation
20.
produces a new second equation, 23 x = 2323
12 x−1 y+2 or x = 101.
+ =4
2 3
9 So, 8(101) − 20 y = −1112 or y = 96, and the solution
6 x − 2y = 5 is: x = 101, y = 96. This is the point where the two
3 lines intersect.
(7, 1)
x
−3 6 12 24. y

x −1 y + 2 5
+ = 4 4
2 3 2
3
3
x + 16 y = 23
x − 2y = 5 2
4x + y = 4
1
Multiplying the first equation by 6 produces a new first x
equation. −1 2 3 4 5 6
3x + 2 y = 23 −2

x − 2y = 5 2x + 1y = 2
3 6 3
Adding the first equation to the second equation 4x + y = 4
produces a new second equation, 4 x = 28 or x = 7.
Adding 6 times the first equation to the second equation
So, 7 − 2 y = 5 or y = 1, and the solution is: x = 7, produces a new second equation, 0 = 0. Choosing
y = 1. This is the point where the two lines intersect. x = t as the free variable, you obtain y = 4 − 4t. So,
you can describe the solution as x = t and y = 4 − 4t ,
where t is any real number.

26. From Equation 2 you have x2 = 3. Substituting this value into Equation 1 produces 2 x1 − 12 = 6 or x1 = 9.
So, the system has exactly one solution: x1 = 9 and x2 = 3.

28. From Equation 3 you have z = 2. Substituting this value into Equation 2 produces 3 y + 2 = 11 or y = 3.
Finally, substituting y = 3 into Equation 1, you obtain x − 3 = 5 or x = 8. So, the system has exactly
one solution: x = 8, y = 3, and z = 2.

30. From the second equation you have x2 = 0. Substituting this value into Equation 1 produces x1 + x3 = 0.
Choosing x3 as the free variable, you have x3 = t and obtain x1 + t = 0 or x1 = −t. So, you can describe the
solution set as x1 = −t , x2 = 0, and x3 = t.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
4 Chapter 1 Systems of Linear Equations

32. (a) −8x + 10y = 14 38. Adding −2 times the first equation to the second
4 equation produces a new second equation.
4x − 5y = 3 3x + 2 y = 2
−6 6 0 = 10
Because the second equation is a false statement, the
original system of equations has no solution.
−4
(b) This system is inconsistent, because you see two 40. Adding −6 times the first equation to the second
parallel lines on the graph of the system. equation produces a new second equation.
x1 − 2 x2 = 0
34. (a) 1
x+ 1
y =0
2 3 9x − 4y = 5 14 x2 = 0
2
Now, using back-substitution, the system has exactly one
solution: x1 = 0 and x2 = 0.
−3 3
42. Multiplying the first equation by 3 produces a new first
2
equation.
−2
x1 + 1x = 0
(b) Two lines corresponding to two equations intersect 4 2
at a point, so this system is consistent. 4 x1 + x2 = 0
(c) The solution is approximately x = 1 and y = − 12 .
3 Adding −4 times the first equation to the second
(d) Adding −18 times the second equation to the first equation produces a new second equation.
x1 + 1x = 0
equation, you obtain −10 y = 5 or y = − 12 . 4 2

Substituting y = − 12 into the first equation, you 0 = 0

obtain 9 x = 3 or x = 13. The solution is: x = 1 Choosing x2 = t as the free variable, you obtain
3
x1 = − 14 t. So you can describe the solution set as
and y = − 12 .
x1 = − 14 t and x2 = t , where t is any real number.
(e) The solutions in (c) and (d) are the same.

36. (a) 44. To begin, change the form of the first equation.
2
−14.7x + 2.1y = 1.05
x1 x 5
+ 2 = −
3 2 6
−3 3
3x1 − x2 = − 2
Multiplying the first equation by 3 yields a new first
equation.
−2 44.1x − 6.3y = −3.15 3 5
x1 + x2 = −
(b) Because the lines coincide, the system is consistent. 2 2
(c) All solutions of this system lie on the line 3 x1 − x2 = − 2
y = 7 x + 12 . So, let x = t , then the solution set is Adding –3 times the first equation to the second equation
produces a new second equation.
x = t , y = 7t + 12 , where t is any real number.
3 5
x1 + x2 = −
(d) Adding 3 times the first equation to the second 2 2
equation you obtain 11 11
− x2 =
− 44.1x + 6.3 y = 3.15 2 2
0 = 0. 2
Multiplying the second equation by − yields a new
Choosing x = t as a free variable, you obtain 11
−14.7t + 2.1 y = 1.05 or −147t + 21y = 105 or second equation.

y = 7t + 12 . 3 5
x1 + x2 = −
2 2
So, you can describe the solution set as x2 = −1
x = t , y = 7t + 12 , where t is any real number.
Now, using back-substitution, the system has exactly one
(e) The solutions in (c) and (d) are the same. solution: x1 = −1 and x2 = −1.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.1 Introduction to Systems of Linear Equations 5

46. Multiplying the first equation by 20 and the second 50. Interchanging the first and third equations yields a new
equation by 100 produces a new system. system.
x1 − 0.6 x2 = 4.2 x1 − 11x2 + 4 x3 = 3
7 x1 + 2 x2 = 17 2 x1 + 4 x2 − x3 = 7
Adding −7 times the first equation to the second 5 x1 − 3 x2 + 2 x3 = 3
equation produces a new second equation. Adding −2 times the first equation to the second
x1 − 0.6 x2 = 4.2 equation yields a new second equation.
6.2 x2 = −12.4 x1 − 11x2 + 4 x3 = 3
Now, using back-substitution, the system has exactly one 26 x2 − 9 x3 = 1
solution: x1 = 3 and x2 = −2. 5 x1 − 3 x2 + 2 x3 = 3
Adding −5 times the first equation to the third equation
48. Adding the first equation to the second equation yields a
yields a new third equation.
new second equation.
x1 − 11x2 + 4 x3 = 3
x + y + z = 2
26 x2 − 9 x3 = 1
4 y + 3 z = 10
52 x2 − 18 x3 = −12
4x + y = 4
At this point, you realize that Equations 2 and 3 cannot
Adding −4 times the first equation to the third equation
both be satisfied. So, the original system of equations has
yields a new third equation.
no solution.
x+ y + z = 2
4 y + 3 z = 10 52. Adding −4 times the first equation to the second
equation and adding −2 times the first equation to the
−3 y − 4 z = −4
third equation produces new second and third equations.
Dividing the second equation by 4 yields a new second x1 + 4 x3 = 13
equation.
−2 x2 − 15 x3 = −45
x+ y + z = 2
3z 5
−2 x2 − 15 x3 = −45
y + 4
= 2
The third equation can be disregarded because it is the
−3 y − 4 z = −4
same as the second one. Choosing x3 as a free variable
Adding 3 times the second equation to the third equation and letting x3 = t , you can describe the solution as
yields a new third equation.
x1 = 13 − 4t
x + y + z = 2
x2 = 45 − 15 t
y + 3z = 5 2 2
4 2
− 74 z = 7 x3 = t , where t is any real number.
2

Multiplying the third equation by − 74 yields a new third 54. Adding −3 times the first equation to the second
equation. equation produces a new second equation.
x+ y + z = 2 x1 − 2 x2 + 5 x3 = 2
y + 3z = 5 8 x2 − 16 x3 = −8
4 2
z = −2 Dividing the second equation by 8 yields a new second
equation.
Now, using back-substitution the system has exactly one
solution: x = 0, y = 4, and z = −2. x1 − 2 x2 + 5 x3 = 2
x2 − 2 x3 = −1
Adding 2 times the second equation to the first equation
yields a new first equation.
x1 + x3 = 0
x2 − 2 x3 = −1
Letting x3 = t be the free variable, you can describe the
solution as x1 = −t , x2 = 2t − 1, and x3 = t , where t is
any real number.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
6 Chapter 1 Systems of Linear Equations

56. Adding 3 times the first equation to the fourth equation 64. x = y = z = 0 is clearly a solution.
yields
Dividing the first equation by 2 produces
− x1 + 2 x4 = 1 3y
x + 2
= 0
4 x2 − x3 − x4 = 2
4x + 3y − z = 0
x2 − x4 = 0
8 x + 3 y + 3 z = 0.
−2 x2 + 3 x3 + 6 x4 = 7.
Adding −4 times the first equation to the second equation,
Interchanging the second equation with the third and −8 times the first equation to the third, yields
equation yields
x + 3y = 0
− x1 + 2 x4 = 1 2
−3 y − z = 0
x2 − x4 = 0
−9 y + 3 z = 0.
4 x2 − x3 − x4 = 2
−2 x2 + 3 x3 + 6 x4 = 7. Adding −3 times the second equation to the third
equation yields
Adding − 4 times the second equation to the third
x + 3y = 0
equation, and adding − 2 times the second equation to 2
−3 y − z = 0
the fourth equation yields
6 z = 0.
− x1 + 2 x4 = 1
x2 − x4 = 0 Using back-substitution, you conclude there is exactly
one solution: x = y = z = 0.
− x3 + 3x4 = 2
3 x3 + 4 x4 = 7. 66. x = y = z = 0 is clearly a solution.

Adding 3 times the second equation to the third equation Dividing the second equation by 2 yields a new second
yields equation.
− x1 + 2 x4 = 1 16 x + 3 y + z = 0
8x + y − 1z = 0
x2 − x4 = 0 2
− x3 + 3 x4 = 2 Adding − 3 times the second equation to the first
13 x4 = 13. equation produces a new first equation.
Using back-substitution, the original system has exactly 5
− 8x + 2
z = 0
one solution: x1 = 1, x2 = 1, x3 = 1, and x4 = 1. 8x + y − 1z = 0
2

Answers may vary slightly for Exercises 58–62. Letting z = t be the free variable, you can describe the
5
solution as x = 16
t, y = − 2t , and z = t , where t is any
58. Using a software program or graphing utility, you obtain
x = 0.8, y = 1.2, z = −2.4. real number.

60. Using a software program or graphing utility, you obtain 68. Let x = the speed of the plane that leaves first and
x = 10, y = − 20, z = 40, w = −12. y = the speed of the plane that leaves second.
y − x = 80 Equation 1
62. Using a software program or graphing utility, you obtain 2x + 3y = 3200 Equation 2
2
x = 6.8813, y = −163.3111, z = −210.2915,
−2 x + 2 y = 160
w = −59.2913. 3
2x + 2
y = 3200
7
2
y = 3360
y = 960
960 − x = 80
x = 880
Solution: First plane: 880 kilometers per hour; second
plane: 960 kilometers per hour

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.1 Introduction to Systems of Linear Equations 7

70. (a) False. Any system of linear equations is either 1 1

consistent, which means it has a unique solution, 74. Substituting A = and B = into the original system
x y
or infinitely many solutions; or inconsistent, which
yields
means it has no solution. This result is stated on
page 5, and will be proved later in Theorem 2.5. 3 A + 2B = −1
(b) True. See definition on page 6. 17
2 A − 3B = − .
(c) False. Consider the following system of three linear 6
equations with two variables. Reduce the system to row-echelon form.
2 x + y = −3 27 A + 18B = − 9
−6 x − 3 y = 9 12 A − 18B = −17
x = 1.
27 A + 18 B = −9
The solution to this system is: x = 1, y = −5. 39 A = − 26
72. Because x1 = t and x2 = s, you can write 2 1
Using back substitution, A = − and B = . Because
x3 = 3 + s − t = 3 + x2 − x1. One system could be 3 2
x1 − x2 + x3 = 3 1 1
A = and B = , the solution of the original system
− x1 + x2 − x3 = −3 x y
3
Letting x3 = t and x2 = s be the free variables, you can of equations is: x = − and y = 2.
2
describe the solution as x1 = 3 + s − t , x2 = s, and
x3 = t , where t and s are any real numbers.

1 1 1
76. Substituting A = , B = , and C = into the original system yields
x y z
2 A + B − 2C = 5
3 A − 4B = −1.
2A + B + 3C = 0
Reduce the system to row-echelon form.
2 A + B − 2C = 5
3A − 4B = −1
5C = −5
3A − 4B = −1
−11B + 6C = −17
5C = −5
So, C = −1. Using back-substitution, −11B + 6( −1) = −17, or B = 1 and 3 A − 4(1) = −1, or A = 1. Because A = 1 x,
B = 1 y , and C = 1 z , the solution of the original system of equations is: x = 1, y = 1, and z = −1.

78. Multiplying the first equation by sin θ and the second by cos θ produces
(sin θ cos θ ) x + (sin 2 θ ) y = sin θ
−(sin θ cos θ ) x + (cos 2 θ ) y = cos θ .
Adding these two equations yields
(sin 2 θ + cos 2 θ ) y = sin θ + cos θ
y = sin θ + cos θ .
So, (cos θ ) x + (sin θ ) y = (cos θ ) x + sin θ (sin θ + cos θ ) = 1 and

x =
(1 − sin 2 θ − sin θ cos θ )
=
(cos2 θ − sin θ cos θ )
= cos θ − sin θ .
cos θ cos θ
Finally, the solution is x = cos θ − sin θ and y = cos θ + sin θ .

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
8 Chapter 1 Systems of Linear Equations

80. Reduce the system to row-echelon form. 88. If c1 = c2 = c3 = 0, then the system is consistent
x+ ky = 0 because x = y = 0 is a solution.

(1 − k ) y
2
= 0 90. Multiplying the first equation by c, and the second by a,
x + ky = 0 produces
y = 0, 1 − k 2 ≠ 0 acx + bcy = ec
acx + day = af .
x = 0
y = 0, 1 − k 2 ≠ 0 Subtracting the second equation from the first yields
acx + bcy = ec
If 1 − k 2 ≠ 0, that is if k ≠ ±1, the system will have
exactly one solution.
(ad − bc) y = af − ec.
So, there is a unique solution if ad − bc ≠ 0.
82. Reduce the system to row-echelon form.
92. y
x + 2 y + kz = 6
(8 − 3k ) z = −14 3
2
This system will have no solution if 8 − 3k = 0, that is, 1
x
k = 83. −3 −2 −1 1 4 5
−2

84. Reduce the system to row-echelon form. −4

kx + y = 16 −5

( 4k + 3) x = 0 The two lines coincide.

The system will have an infinite number of solutions 2x − 3y = 7
when 4k + 3 = 0  k = − 34 . 0 = 0
86. Reducing the system to row-echelon form produces 7 + 3t
Letting y = t , x = .
x + 5y + z = 0 2
y − 2z = 0 The graph does not change.
(a − 10) y + (b − 2) z = c 94. 21x − 20 y = 0
x + 5y + z = 0 13 x − 12 y = 120
y − 2z = 0 Subtracting 5 times the second equation from 3 times the
( 2a + b − 22) z = c. first equation produces a new first equation,
−2 x = −600, or x = 300. So, 21(300) − 20 y = 0 or
So, you see that
(a) if 2a + b − 22 ≠ 0, then there is exactly one y = 315, and the solution is: x = 300, y = 315. The
solution. graphs are misleading because they appear to be parallel,
(b) if 2a + b − 22 = 0 and c = 0, then there is an but they actually intersect at (300, 315).
infinite number of solutions.
(c) if 2a + b − 22 = 0 and c ≠ 0, there is no solution.

Section 1.2 Gaussian Elimination and Gauss-Jordan Elimination

2. Because the matrix has 4 rows and 1 column, it has size  3 −1 −4 3 −1 −4
4 × 1. 8.     
−4 3 7  5 0 −5
4. Because the matrix has 1 row and 1 column, it has size Add 3 times Row 1 to Row 2.
1 × 1.
−1 −2 3 −2 −1 −2 3 −2
6. Because the matrix has 1 row and 5 columns, it has size    
10.  2 − 5 1 − 7   0 − 9 7 −11
1 × 5.
 5 4 −7 6  0 − 6 8 − 4
  
Add 2 times Row 1 to Row 2. Then add 5 times Row 1
to Row 3.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.2 Gaussian Elimination and Gauss-Jordan Elimination 9

12. Because the matrix is in reduced row-echelon form, you 24. The matrix satisfies all three conditions in the definition
can convert back to a system of linear equations of row-echelon form. Moreover, because each column
x1 = 2 that has a leading 1 (columns one and four) has zeros
elsewhere, the matrix is in reduced row-echelon form.
x2 = 3.
26. The augmented matrix for this system is
14. Because the matrix is in row-echelon form, you can
convert back to a system of linear equations  2 6 16
 .
x1 + 2 x2 + x3 = 0 −2 −6 −16
x3 = −1. Use Gauss-Jordan elimination as follows.

Using back-substitution, you have x3 = −1. Letting  2 6 16  1 3 8  1 3 8

       
x2 = t be the free variable, you can describe the −2 −6 −16 −2 −6 −16 0 0 0
solution as x1 = 1 − 2t , x2 = t , and x3 = −1, where t Converting back to a system of linear equations, you have
is any real number. x + 3 y = 8.
Choosing y = t as the free variable, you can describe
16. Gaussian elimination produces the following.
the solution as x = 8 − 3t and y = t , where t is any
3 −1 1 5 1 0 1 2
    real number.
1 2 1 0  1 2 1 0
1 0 1 2 3 −1 1 5 28. The augmented matrix for this system is
   
 1 0 1 2  1 0 1 2 2 −1 −0.1
     .
 0 2 0 − 2  0 2 0 − 2 3 2 1.6
3 −1 1 2 0 −1 − 2 −1 Gaussian elimination produces the following.
   
 1 0 1 2  1 0 1 2 2 −1 −0.1 1 − 12 − 20
1
  
 0 1 2 1  0 1 2 1
     8
3 2 1.6 3 2 5
0 2 0 − 2 0 0 − 4 − 4
     1 − 12 1
− 20
 1 0 1 2   7 7

  0 2 4
 0 1 2 1
0 0 1 1  1 − 12 − 20
1 1 0 1
5
    1
   1

0 1 2 0 1 2
Because the matrix is in row-echelon form, convert back
to a system of linear equations. Converting back to a system of equations, the solution is:
x1 + x3 = 2 x = 15 and y = 12 .
x2 + 2 x3 = 1 30. The augmented matrix for this system is
x3 = 1 1 2 0
 
By back-substitution, x1 = 1, x2 = −1, and x3 = 1. 1 1 6.
3 −2 8
 
18. Because the fourth row of this matrix corresponds to the
equation 0 = 2, there is no solution to the linear Gaussian elimination produces the following.
system. 1 2 0  1 2 0
   
20. Because the leading 1 in the first row is not farther to the 1 1 6  0 −1 6
3 −2 8 0 −8 8
left than the leading 1 in the second row, the matrix is    
not in row-echelon form.  1 2 0 1 2 0
   
22. The matrix satisfies all three conditions in the definition  0 1 −6  0 1 −6
of row-echelon form. However, because the third column 0 −8 8 0 0 −40
   
does not have zeros above the leading 1 in the third row,
the matrix is not in reduced row-echelon form. Because the third row corresponds to the equation
0 = − 40, you can conclude that the system has
no solution.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
10 Chapter 1 Systems of Linear Equations

32. The augmented matrix for this system is 34. The augmented matrix for this system is
3 − 2 3 22  1 1 −5 3
   1 0 −2 1.
0 3 −1 24.  
6 − 7 0 − 22 2 −1 −1 0
 
Gaussian elimination produces the following. Subtracting the first row from the second row yields a
new second row.
3 − 2 3 22 1 − 2 1 22 
3 3
     1 1 −5 3
0 3 − 1 24  0 1 − 1
3
8 0 −1 3 −2
     
6 − 7 0 − 22 6 − 7 0 − 22 2 −1 −1 0
1 − 2 1 22 
Adding −2 times the first row to the third row yields a
3 3
  new third row.
 0 1 − 13 8
   1 1 −5 3
0 − 3 − 6 − 66 0 −1 3 −2
 
1 − 2 1 22 
0 −3 9 −6
3 3
 
 0 1 − 13 8 Multiplying the second row by −1 yields a new second
 
0 0 − 7 − 42 row.

1 − 2 22   1 1 −5 3
1 0
 3 3
  1 −3 2
 0 1
1 −3 8 0 −3 9 −6
 
0 0 1 6
Adding 3 times the second row to the third row yields a
Back-substitution now yields new third row.
x3 = 6  1 1 −5 3
0 1 −3 2
x2 = 8 + 1
x
3 3
= 8+ 1
3
( 6) = 10  
0 0 0 0
x1 = 22
3
+ 2
x
3 2
− x3 = 22
3
+ 2
3
(10) − (6) = 8.
Adding −1 times the second row to the first row yields a
So, the solution is: x1 = 8, x2 = 10, and x3 = 6. new first row.
 1 0 −2 1
0 1 −3 2
 
0 0 0 0

Converting back to a system of linear equations produces

x1 − 2 x3 = 1
x2 − 3x3 = 2.
Finally, choosing x3 = t as the free variable, you can
describe the solution as x1 = 1 + 2t , x2 = 2 + 3t , and
x3 = t , where t is any real number.

36. The augmented matrix for this system is

 1 2 1 8
 .
−3 −6 −3 −21
Gaussian elimination produces the following matrix.
 1 2 1 8
 
0 0 0 3
Because the second row corresponds to the equation
0 = 3, there is no solution to the original system.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.2 Gaussian Elimination and Gauss-Jordan Elimination 11

38. The augmented matrix for this system is

2 1 −1 2 −6
 
3 4 01 1
.
1 5 2 6 −3
 
5 2 −1 −1 3
Gaussian elimination produces the following.
1 5 26 −3 1 5 2 6 −3 1 5 2 6 −3
     6 17 − 10 
3 4 01 1 0 −11 −6 −17 10 0 1
     11 11 11 
2 1 −1 2 −6 0 −9 −5 −10 0 0 −9 −5 −10 0
     
5 2 −1 −1 3 0 −23 −11 −31 18 0 −23 −11 −31 18

1 5 2 6 −3 1 5 2 −3
6
 6 17 10   6 17 
0 1 11 11
− 11  0 1 11
− 10
11 
11
    0 0
0 0 1
− 11 43 − 90 1 − 43 90
 11 11   
0 0 17 50 − 32  0 0 17 50 − 32 
11 11 11  11 11 4

1 5 2 −3 6 1 5 2 −3
6
 6 10 
17  
0 1 − 11  0 1 6 17− 10
  11 11
 11 11 11 
0 0 1 − 43 90 0 0 1 − 43 90
   
0 781 1562
− 11 
0 0 11 0 0 0 1 −2
Back-substitution now yields
w = −2
z = 90 + 43w = 90 + 43( −2) = 4
y = − 10
11 ( ) 11 ( ) 11 ( ) 11 ( )
6 z − 17 w = − 10 − 6 4 − 17 −2 = 0
− 11 11
.
x = −3 − 5 y − 2 z − 6 w = −3 − 5(0) − 2( 4) − 6( −2) = 1.
So, the solution is: x = 1, y = 0, z = 4, and w = −2.

40. Using a software program or graphing utility, the 44. The corresponding equations are
augmented matrix reduces to x1 = 0
x2 + x3 = 0.
1 0 0 0 0 2
  Choosing x4 = t and x3 = t as the free variables, you
0 1 0 0 0 −1
0 0 1 0 0 3. can describe the solution as x1 = 0, x2 = − s, x3 = s,
  and x4 = t , where s and t are any real numbers.
0 0 0 1 0 4
 
0 0 0 0 1 1 46. The corresponding equations are all 0 = 0. So, there are
So, the solution is: three free variables. So, x1 = t , x2 = s, and x3 = r ,
x1 = 2, x2 = −1, x3 = 3, x4 = 4, and x5 = 1. where t , s, and r are any real numbers.

42. Using a computer software program or graphing utility,

you obtain
x1 = 1
x2 = −1
x3 = 2
x4 = 0
x5 = −2
x6 = 1.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
12 Chapter 1 Systems of Linear Equations

48. x = number of $1 bills 50. (a) If A is the augmented matrix of a system of linear
y = number of $5 bills equations, then the number of equations in this
system is three (because it is equal to the number of
z = number of $10 bills rows of the augmented matrix). The number of
w = number of $20 bills variables is two because it is equal to the number of
x + 5 y + 10 z + 20 w = 95 columns of the augmented matrix minus one.
x + y + z + w = 26 (b) Using Gaussian elimination on the augmented matrix
of a system, you have the following.
y − 4z = 0
 2 −1 3 2 −1 3 
x − 2y = −1    
−4 2 k   0 0 k + 6
 1 5 10 20 95 1 0 0 0 15  4 −2 6 0 0 0 
      
 1 1 1 1 26  0 1 0 0 8
This system is consistent if and only if k + 6 = 0,
0 1 −4 0 0 0 0 1 0 2
    so k = −6.
 1 −2 0 0 −1 0 0 0 1 1 If A is the coefficient matrix of a system of linear
x = 15 equations, then the number of equations is three,
y = 8 because it is equal to the number of rows of the
coefficient matrix. The number of variables is also
z = 2 three, because it is equal to the number of columns
w =1 of the coefficient matrix.
The server has 15 $1 bills, 8 $5 bills, 2 $10 bills, and one Using Gaussian elimination on A you obtain the
$20 bill. following coefficient matrix of an equivalent system.
1 − 1 3 
2 2
 
0 0 k + 6
0 0 0 

Because the homogeneous system is always
consistent, the homogeneous system with the
coefficient matrix A is consistent for any value of k.

52. Using Gaussian elimination on the augmented matrix, you have the following.
1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0
       
0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0
     
1 0 1 0  0 −1 1 0  0 0 2 0   0 0 1 0
       
a b c 0 0 (b − a) c 0 0 0 (a − b + c) 0 0 0 0 0
From this row reduced matrix you see that the original system has a unique solution.

54. Because the system composed of Equations 1 and 2 is consistent, but has a free variable, this system must have an infinite
number of solutions.

56. Use Gauss-Jordan elimination as follows.

1 2 3 1 2 3 1 2 3  1 0 −1
       
4 5 6  0 −3 −6  0 1 2  0 1 2
7 8 9 0 −6 −12 0 0 0 0 0 0
       

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.2 Gaussian Elimination and Gauss-Jordan Elimination 13

58. Begin by finding all possible first rows

[0 0 0], [0 0 1], [0 1 0], [0 1 a], [1 0 0], [1 0 a], [1 a b], [1 a 0],
where a and b are nonzero real numbers. For each of these examine the possible remaining rows.

0 0 0 0 0 1 0 1 0 0 1 0 0 1 a
         
0 0 0, 0 0 0, 0 0 0, 0 0 1, 0 0 0,
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
         
1 0 0 1 0 0 1 0 0 1 0 0 1 0 0
         
0 0 0, 0 1 0, 0 1 0, 0 0 1, 0 1 a,
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0
         
1 a 0 1 a 0 1 a b 1 0 a 1 0 a
         
0 0 0, 0 0 1, 0 0 0, 0 0 0, 0 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
         

60. (a) False. A 4 × 7 matrix has 4 rows and 7 columns. 64. First, you need a ≠ 0 or c ≠ 0. If a ≠ 0, then you
(b) True. Reduced row-echelon form of a given matrix have
is unique while row-echelon form is not. (See also a b 
exercise 64 of this section.) a b     a b 
    cb   .
(c) True. See Theorem 1.1 on page 21.  c d  0 − +b  0 ad − bc
 a 
(d) False. Multiplying a row by a nonzero constant is
one of the elementary row operations. However, So, ad − bc = 0 and b = 0, which implies that d = 0.
multiplying a row of a matrix by a constant c = 0 If c ≠ 0, then you interchange rows and proceed.
is not an elementary row operation. (This would c d 
change the system by eliminating the equation a b     c d 
    
corresponding to this row.) c d  0 − ad + b 0 ad − bc
 c 
62. No, the row-echelon form is not unique. For instance, Again, ad − bc = 0 and d = 0, which implies that
1 2 1 0
  and  . The reduced row-echelon form is a b 
0 1 0 1 b = 0. In conclusion,   is row-equivalent to
c d 
unique.
1 0
  if and only if b = d = 0, and a ≠ 0 or c ≠ 0.
0 0

66. Row reduce the augmented matrix for this system.

2λ + 9 − 5 0  1 − λ 0 1 −λ 0
       
 1 − λ 0 2λ + 9 − 5 0 0 2λ + 9λ − 5 0
2

To have a nontrivial solution you must have the following.

2 λ 2 + 9λ − 5 = 0
(λ + 5)( 2λ − 1) = 0
1
So, if λ = − 5 or λ = 2
, the system will have nontrivial solutions.

68. A matrix is in reduced row-echelon form if every column 70. (a) When a system of linear equations is inconsistent,
that has a leading 1 has zeros in every position above and the row-echelon form of the corresponding
below its leading 1. A matrix in row-echelon form may augmented matrix will have a row that is all zeros
have any real numbers above the leading 1’s. except for the last entry.
(b) When a system of linear equations has infinitely
many solutions, the row-echelon form of the
corresponding augmented matrix will have a row
that consists entirely of zeros or more than one
column with no leading 1’s. The last column will not
contain a leading 1.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
14 Chapter 1 Systems of Linear Equations

Section 1.3 Applications of Systems of Linear Equations

2. (a) Because there are three points, choose a second-degree polynomial, p ( x) = a0 + a1 x + a2 x 2 .
Then substitute x = 0, 2, and 4 into p ( x ) and equate the results to y = 0, − 2, and 0, respectively.

a0 + a1 (0) + a2 (0) = a0
2
= 0
a0 + a1 ( 2) + a2 ( 2) = a0 + 2a1 + 4a2 = − 2
2

a0 + a1 ( 4) + a2 ( 4) = a0 + 4a1 + 16a2 = 0
2

Use Gauss-Jordan elimination on the augmented matrix for this system.

1 0 0 0 1 0 0 0
   
1 2 4 − 2   0 1 0 − 2
1 4 16 0 0 0 1 1
  2

So, p ( x) = − 2 x + 1 2
2
x .

(b) y

(0, 0) (4, 0)
x
−2 2 4 6
−2
(2, − 2)
−4

4. (a) Because there are three points, choose a second-degree polynomial, p( x) = a0 + a1x + a2 x 2 .
Then substitute x = 2, 3, and 4 into p( x) and equate the results to y = 4, 4, and 4, respectively.
a0 + a1 ( 2) + a2 ( 2) = a0 + 2a1 + 4a2 = 4
2

a0 + a1 (3) + a2 (3) = a0 + 3a1 + 9a2 = 4

2

a0 + a1 ( 4) + a2 ( 4) = a0 + 4a1 + 16a2 = 4
2

Use Gauss-Jordan elimination on the augmented matrix for this system.

1 2 4 4 1 0 0 4
   
1 3 9 4  0 1 0 0
1 4 16 4 0 0 1 0
   
So, p( x) = 4.
(b) y
5
(2, 4) (4, 4)

3
(3, 4)

2
1
x
1 2 3 4 5

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.3 Applications of Systems of Linear Equations 15

6. (a) Because there are four points, choose a third-degree polynomial, p ( x) = a0 + a1 x + a2 x 2 + a3 x3 . Then substitute
x = 0, 1, 2, and 3 into p ( x) and equate the results to y = 42, 0, − 40, and − 72, respectively.

a0 + a1 (0) + a2 (0) + a3 (0) = a0

2 3
= 42
a0 + a1 (1) + a2 (1) + a3 (1)
2 3
= a0 + a1 + a2 + a3 = 0
a0 + a1 ( 2) + a2 ( 2) + a3 ( 2) = a0 + 2a1 + 4a2 + 8a3
2 3
= − 40
a0 + a1 (3) + a2 (3) + a3 (3) = a0 + 3a1 + 9a2 + 27 a3 = − 72
2 2

Use Gauss-Jordan elimination on the augmented matrix for this system.

1 0 0 42 0 1 0 0 0 42
   
1 1 1 1 0 0 1 0 0 − 41
 
1 2 4 8 − 40  0 0 1 0 − 2
   
1 3 9 27 − 72 0 0 0 1 1

So, p ( x) = 42 − 41x − 2 x 2 + x3 .
(b) y

60 (0, 42)
30 (1, 0)
x
−4 −2 4 6 8 10
−60
−90
(3, − 72)
(2, − 40)

8. (a) Because there are five points, choose a fourth-degree polynomial, p ( x) = a0 + a1 x + a2 x 2 + a3 x3 + a4 x 4 . Then
substitute x = − 4, 0, 4, 6, and 8 into p ( x ) and equate the results to y = 18, 1, 0, 28, and 135, respectively.

a0 + a1 ( − 4) + a2 ( − 4) + a3 ( − 4) + a4 ( − 4) = a0 − 4a1 + 16a2 − 64a3 + 256a4 = 18

2 3 4

a0 + a1 (0) + a2 (0) + a3 (0) + a4 (0)

2 3 4
= a0 =1
a0 + a1 ( 4) + a2 ( 4) + a3 ( 4) + a4 ( 4)
2 3 4
= a0 + 4a1 + 16a2 + 64a3 + 256a4 = 0
a0 + a1 (6) + a2 (6) + a3 (6) + a4 (6)
2 3 4
= a0 + 6a1 + 36a2 + 216a3 + 1296a4 = 28
a0 + a1 (8) + a2 (8) + a3 (8) + a4 (8)
2 3 4
= a0 + 8a1 + 64a2 + 512a3 + 4096a4 = 135
Use Gauss-Jordan elimination on the augmented matrix for this system.
1 − 4 16 − 64 256 18 1 0 0 0 0 1
   3
1 0 0 0 0 1 0 1 0 0 0 4
1 4 16 64 256 0  0 0 1 0 0 − 12 
   
0 3
− 16
1 6 36 216 1296 28 0 0 1 0
   1
1 8 64 512 4096 135 0 0 0 0 1 16 

So, p ( x) = 1 + 3
4
x − 1 2
2
x − 3 3
16
x + 1 4
16
x = 1
16 (16 + 12 x − 8 x2 − 3x3 + x 4 ).

(b) y

120 (8, 135)

80
(0, 1) (6, 28)
40
(− 4, 18) (4, 0)
x
−8 −4 4 8 12

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
16 Chapter 1 Systems of Linear Equations

10. (a) Let z = x − 2012. Because there are four points, choose a third-degree polynomial, p( z ) = a0 + a1 z + a2 z 2 + a3 z 3.
Then substitute z = 0, 1, 2, and 3 into p( z ) and equate the results to y = 150, 180, 240, and 360 respectively.

a0 + a1 (0) + a2 (0) + a3 (0) = a0

2 3
= 150
a0 + a1 (1) + a2 (1) + a3 (1)
2 3
= a0 + a1 + a2 + a3 = 180
a0 + a1 ( 2) + a2 ( 2) + a3 ( 2) = a0 + 2a1 + 4a2 + 8a3 = 240
2 3

a0 + a1 (3) + a2 (3) + a3 (3) = a0 + 3a1 + 9a2 + 27 a3 = 360

2 3

Use Gauss-Jordan elimination on the augmented matrix for this system.

1 0 0 150  0 1 0 0 0 150
   
1 1 1 1 180 
 
0 1 0 0 25 
1 2 4 8 240 0 0 1 0 0 
   
1 3 9 27 360 0 0 0 1 5 

So, p( z ) = 150 + 25 z + 5 z 3 , or p( x) = 150 + 25( x − 2012) + 5( x − 2012) .

3

(b) y
400 (3, 360)
300
(2, 240)
(0, 150) (1, 180)
100

x
1 2 3
(2012)(2013)(2014)(2015)

12. (a) Because there are four points, choose a third-degree polynomial, p ( x) = a0 + a1 x + a2 x 2 + a3 x3 . Then substitute
x = 1, 1.189, 1.316, and 1.414 into p ( x ) and equate the results to y = 1, 1.587, 2.080, and 2.520, respectively.

a0 + a1 (1) + a2 (1) + a3 (1)

2 3
= a0 + a1 + a2 + a3 = 1
a0 + a1 (1.189) + a2 (1.189) + a3 (1.189) ≈ a0 + 1.189a1 + 1.414a2 + 1.681a3 = 1.587
2 3

a0 + a1 (1.316) + a2 (1.316) + a3 (1.316) ≈ a0 + 1.316a1 + 1.732a2 + 2.279a3 = 2.080

2 3

a0 + a1 (1.414) + a2 (1.414) + a3 (1.414) ≈ a0 + 1.414a1 + 1.999a2 + 2.827 a3 = 2.520

2 3

Use Gauss-Jordan elimination on the augmented matrix for this system.

1 1 1  1
1 1 0 0 0 − 0.095
   
1 1.189 1.414 1.681 1.587 
 
0 1 0 0 0.103
1 1.316 1.732 2.279 2.080 0 0 1 0 0.405
   
1 1.414 1.999 2.827 2.520 0 0 0 1 0.587

So, p ( x) ≈ − 0.095 + 0.103 x + 0.405 x 2 + 0.587 x3 .

(b) y
4
(1.414, 2.520)
3
(1.316, 2.080)
2 (1.189, 1.587)
1 (1, 1)
x
−3 −2 −1 1 2 3
−2
−3
−4

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.3 Applications of Systems of Linear Equations 17

14. Choosing a second-degree polynomial approximation p( x) = a0 + a1x + a2 x 2 , substitute x = 1, 2, and 4

into p( x) and equate the results to y = 0, 1, and 2, respectively.
a0 + a1 + a2 = 0
a0 + 2a1 + 4a2 = 1
a0 + 4a1 + 16a2 = 2
The solution to this system is a0 = − 43 , a1 = 3, and a2 = − 16 .
2

So, p( x) = − 43 + 3x
2
− 16 x 2 .

Finally, to estimate log 2 3, calculate p(3) = − 43 + (3) − 16 (3)

3 2
2
= 53.

16. Assume that the equation of the circle is x 2 + ax + y 2 + by − c = 0. Because each of the given points lie on the circle, you
have the following linear equations.
(− 5) + a( − 5) + (1) + b(1) − c = − 5a +
2 2 2
b − c + 26 = 0
(− 3) + a( − 3) + ( 2) + b( 2) − c = − 3a + 2b − c + 13 = 0
2 2

(−1) + a( −1) + (1) + b(1) − c =

2 2
−a + b − c + 2 = 0
Use Gauss-Jordan elimination on the system.
− 5 1 −1 − 26 1 0 0 6
   
 − 3 2 − 1 − 13  0 1 0 1
   
 −1 1 −1 − 2 0 0 1 − 3

( )
2
So, the equation of the circle is x 2 − 6 x + y 2 + y + 3 = 0, or ( x − 3) + y −
2 1 25
2
= 4
.

x − 1970
18. (a) Letting z = , the four data points are (0, 205), (1, 227), ( 2, 249), and (3, 282). Let
10
p( z ) = a0 + a1z + a2 z 2 + a3 z 3 . Substituting the points into p( z ) produces the following system of linear equations.

a0 + a1 (0) + a2 (0) + a3 (0) = a0

2 3
205
a0 + a1 (1) + a2 (1) + a3 (1) = a0 +
2 3
a1 + a2 + a3 = 227
a0 + a1 ( 2) + a2 ( 2) + a3 ( 2) = a0 + 2a1 + 4a2 +
2 3
8a3 = 249
a0 + a1 (3) + a2 (3) + a3 (3) = a0 + 3a1 + 9a2 + 27 a3 = 282
2 3

Form the augmented matrix

1 0 0 0 205
 
1 1 1 1 227
1 2 4 8 249
 
1 3 9 27 282
and use Gauss-Jordan elimination to obtain the equivalent reduced row-echelon matrix.
 1 0 0 0 205
 77 
0 1 0 0 3
 11
0 0 1 0 − 2 
0 0 0 1 11
 6
77 11 11
So, the cubic polynomial is p( z ) = 205 + z − z 2 + z 3.
3 2 6
3
x − 1970 77  x − 1970  11 x − 1970  11 x − 1970 
Because z = , p( x) = 205 +  −  +  .
10 3  10  2  10  6  10 
77 11 2 11 3
(b) To estimate the population in 2010, let x = 2010. p( 2010) = 205 + (4) − (4) + (4) = 337 million,
3 2 6
which is greater than the actual population of 309 million.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
18 Chapter 1 Systems of Linear Equations

20. (a) Letting z = x − 2000, the five points (6, 348.7), (7, 378.8), (8, 405.6), (9, 408.2), and (10, 421.8).
Let p( z ) = a0 + a1 z + a2 z 2 + a3 z 3 + a4 z 4 .

a0 + a1 (6) + a2 (6) + a3 (6) + a4 (6) = a0 + 6a1 + 36a2 + 216a3 +

2 3 4
1296a4 = 348.7
a0 + a1 (7) + a2 (7) + a3 (7) + a4 (7) = a0 + 7 a1 + 49a2 + 343a3 +
2 3 4
2401a4 = 378.8
a1 (8) + a2 (8) + a3 (8) + a4 (8) = a0 + 8a1 + 64a2 + 512a3 +
2 3 4
a0 + 4096a4 = 405.6
a0 + a1 (9) + a2 (9) + a3 (9) + a4 (9) = a0 + 9a1 +
2 3 4
81a2 + 729a3 + 6561a4 = 408.2
a0 + a1 (10) + a2 (10) + a3 (10) + a4 (10) = a0 + 10a1 + 100a2 + 1000a3 + 10,000a4 = 421.8
2 3 4

(b) Use Gauss-Jordan elimination to solve the system.

1 6 36 216 1296 348.7 1 0 0 0 0 8337.8
   
1 7 49 343 2401 378.8 0 1 0 0 0 − 4313.89
1 8 64 512 4096 405.6  0
 0 1 0 0 854.563
   
1 9 81 729 6561 408.2 0 0 0 1 0 − 73.608
   
1 10 100 1000 10,000 421.8 0 0 0 0 1 2.338

So, p( z ) = 8337.8 − 4313.89 z + 854.563z 2 − 73.608 z 3 + 2.338 z 4 . Because z = x − 2000,

p( x) = 8337.8 − 4313.89( x − 2000) + 854.563( x − 2000) − 73.608( x − 2000) + 2.338( x − 2000) .
2 3 4

To determine the reasonableness of the model for years after 2010, compare the predicted values for 2011–2013 to
the actual values.
x 2011 2012 2013
p( x) 537.8 903.4 1722.3
Actual 447.0 469.2 476.2

The model does not produce reasonable outcomes after 2010.

22. (a) Each of the network’s four junctions gives rise to a linear equation as shown below.
input = output
300 = x1 + x2
x1 + x3 = x4 + 150
x2 + 200 = x3 + x5
x4 + x5 = 350
Rearrange these equations, form the augmented matrix, and use Gauss-Jordan elimination.
 1 1 0 0 0 300  1 0 1 0 1 500
 1 0 1 −1 0 150  
   0 1 −1 0 −1 −200
0 1 −1 0 −1 −200 0 0 0 1 1 350
   
0 0 0 1 1 350 0 0 0 0 0 0
Letting x5 = t and x3 = s be the free variables, you have
x1 = 500 − s − t
x2 = −200 + s + t
x3 = s
x4 = 350 − t
x5 = t , where t and s are any real numbers.
(b) If x2 = 200 and x3 = 50, then you have s = 50 and t = 350.
So, the solution is: x1 = 100, x2 = 200, x3 = 50, x4 = 0, and x5 = 350.
(c) If x2 = 150 and x3 = 0, then you have s = 0 and t = 350.
So, the solution is: x1 = 150, x2 = 150, x3 = 0, x4 = 0, and x5 = 350.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.3 Applications of Systems of Linear Equations 19

24. (a) Each of the network’s six junctions gives rise to a linear equation as shown below.
input = output
600 = x1 + x3
x1 = x2 + x4
x2 + x5 = 500
x3 + x6 = 600
x4 + x7 = x6
500 = x5 + x7
Rearrange these equations, form the augmented matrix, and use Gauss-Jordan elimination.
1 0 1 0 0 0 0 600 1 0 0 0 0 −1 0 0
   
 1 −1 0 −1 0 0 0 0 0 1 0 0 0 0 −1 0
0 1 0 0 1 0 0 500 0 0 1 0 0 1 0 600
    
0 0 1 0 0 1 0 600 0 0 0 1 0 −1 1 0
   
0 0 0 1 0 −1 1 0 0 0 0 0 1 0 1 500
0 0 0 0 1 
0 1 500 0 0 0 0 0 0 0 0
 
Letting x7 = t and x6 = s be the free variables, you have
x1 = s
x2 = t
x3 = 600 − s
x4 = s − t
x5 = 500 − t
x6 = s
x7 = t , where s and t are any real numbers.
(b) If x1 = x2 = 100, then the solution is x1 = 100, x2 = 100, x3 = 500, x4 = 0, x5 = 400, x6 = 100, and x7 = 100.
(c) If x6 = x7 = 0, then the solution is x1 = 0, x2 = 0, x3 = 600, x4 = 0, x5 = 500, x6 = 0, and x7 = 0.
(d) If x5 = 1000 and x6 = 0, then the solution is x1 = 0, x2 = −500, x3 = 600, x4 = 500, x5 = 1000, x6 = 0,
and x7 = −500.

26. Applying Kirchoff’s first law to three of the four junctions produces
I1 + I 3 = I 2
I1 + I 4 = I 2
I3 + I 6 = I5
and applying the second law to the three paths produces
R1I1 + R2 I 2 = 3I1 + 2 I 2 = 14
R2 I 2 + R4 I 4 + R5 I 5 + R3 I 3 = 2 I 2 + 2 I 4 + I 5 + 4 I 3 = 25
R5 I 5 + R6 I 6 = I5 + I 6 = 8.
Rearrange these equations, form the augmented matrix, and use Gauss-Jordan elimination.
 1 −1 1 0 0 0 0 1 0 0 0 0 0 2
   
 1 −1 0 1 0 0 0 0 1 0 0 0 0 4
0 0 1 0 −1 1 0  0 0 1 0 0 0 2
    
3 2 0 0 0 0 14 0 0 0 1 0 0 2
   
0 2 4 2 1 0 25 0 0 0 0 1 0 5
0 0 0 0 1 1 8 0 0 0 0 0 1 3
 
So, the solution is: I1 = 2, I 2 = 4, I 3 = 2, I 4 = 2, I 5 = 5, and I 6 = 3.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
20 Chapter 1 Systems of Linear Equations

28. (a) For a set of n points with distinct x-values, substitute the points into the polynomial p ( x) = a0 + a1 x +  + an −1 x n −1.
This creates a system of linear equations in a0 , a1 ,  an −1. Solving the system gives values for the coefficients an , and
the resulting polynomial fits the original points.
(b) In a network, the total flow into a junction is equal to the total flow out of a junction. So, each junction determines an
equation, and the set of equations for all the junctions in a network forms a linear system. In an electrical network,
Kirchhoff’s Laws are used to determine additional equations for the system.

50 + 25 + T2 + T3
30. T1 =
4
50 + 25 + T1 + T4 4T1 − T2 − T3 = 75
T2 =
4 − T1 + 4T2 − T4 = 75

25 + 0 + T1 + T4 − T1 + 4T3 − T4 = 25
T3 =
4 − T2 − T3 + 4T4 = 25
25 + 0 + T2 + T3
T4 =
4
Use Gauss-Jordan elimination to solve this system.
 4 −1 −1 0 75 1 0 0 0 31.25
   
−1 4 0 −1 75
 
0 1 0 0 31.25
−1 0 4 −1 25 0 0 1 0 18.75
   
 0 −1 −1 4 25 0 0 0 1 18.75
So, T1 = 31.25°C, T2 = 31.25°C, T3 = 18.75°C, and T4 = 18.75°C.

3x 2 − 7 x − 12 A B C
32. = + +
(x + 4)( x − 4) x − 4 ( x − 4)2
2
x+4

3x 2 − 7 x − 12 = A( x − 4) + B( x + 4)( x − 4) + C ( x + 4)
2

3x 2 − 7 x − 12 = Ax 2 − 8 Ax + 16 A + Bx 2 − 16 B + Cx + 4C
3x 2 − 7 x − 12 = ( A + B ) x 2 + ( −8 A + C ) x + 16 A − 16 B + 4C
So, A + B = 3
−8 A + C = −7
16 A − 16 B + 4C = −12.
Use Gauss-Jordan elimination to solve the system.
 1 1 0 3  1 0 0 1
   
−8 0 1 −7   0 1 0 2
16 −16 4 −12 0 0 1 1
   
The solution is: A = 1, B = 2, and C = 1.
3x 2 − 7 x − 12 1 2 1
So, = + +
(x + 4)( x − 4) x − 4 ( x − 4)2
2
x+4

34. Use Gauss-Jordan elimination to solve the system.

0 2 2 −2  1 0 0 25
   
2 0 1 −1  0 1 0 50
2 1 0 100 0 0 1 −51
   
So, x = 25, y = 50, and λ = −51.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Section 1.3 Applications of Systems of Linear Equations 21

36. 2 y + 2λ + 2 = 0
2x + λ + 1 = 0
2x + y − 100 = 0
The augmented matrix for this system is
0 2 2 − 2 
 
2 0 1 −1 .
2 1 0 100
 
Gauss-Jordan elimination produces the matrix
 1 0 0 25
 
0 1 0 50.
0 0 1 − 51
 
So, x = 25, y = 50, and λ = − 51.

38. To begin, substitute x = −1 and x = 1 into p( x) = a0 + a1x + a2 x 2 + a3 x3 and equate the results to y = 2 and y = −2,
respectively.
a0 − a1 + a2 − a3 = 2
a0 + a1 + a2 + a3 = −2

Then, differentiate p, yielding p′( x) = a1 + 2a2 x + 3a3 x 2 . Substitute x = −1 and x = 1 into p′( x) and equate the results to 0.
a1 − 2a2 + 3a3 = 0
a1 + 2a2 + 3a3 = 0
Combining these four equations into one system and forming the augmented matrix, you obtain
 1 −1 1 −1 2
 1 1 1 1 −2
 .
0 1 −2 3 0
 
0 1 2 3 0
Use Gauss-Jordan elimination to find the equivalent reduced row-echelon matrix
1 0 0 0 0
0 1 0 0 −3
 .
0 0 1 0 0
 
0 0 0 1 1

So, p( x) = −3 x + x3 . The graph of y = p( x) is shown below.

y
(− 1, 2)

x
−1 1 2
−1

−2
(1, − 2)

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
22 Chapter 1 Systems of Linear Equations

40. Let
p1 ( x) = a0 + a1 x + a2 x 2 +  + an −1 x n −1 and p2 ( x) = b0 + b1x + b2 x 2 +  + bn −1x n −1
be two different polynomials that pass through the n given points. The polynomial
p1 ( x) − p2 ( x) = ( a0 − b0 ) + ( a1 − b1 ) x + ( a2 − b2 ) x 2 +  + ( an −1 − bn −1 ) x n −1
is zero for these n values of x. So, a0 = b0 , a1 = b1 , a2 = b2 , , an −1 = bn −1.
Therefore, there is only one polynomial function of degree n − 1 (or less) whose graph passes through n points in the plane
with distinct x-coordinates.

42. Choose a fourth-degree polynomial and substitute x = 1, 2, 3, and 4 into p( x) = a0 + a1x + a2 x 2 + a3 x3 + a4 x 4 .

However, when you substitute x = 3 into p( x) and equate it to y = 2 and y = 3 you get the contradictory equations
a0 + 3a1 + 9a2 + 27 a3 + 81a4 = 2
a0 + 3a1 + 9a2 + 27 a3 + 81a4 = 3
and must conclude that the system containing these two equations will have no solution. Also, y is not a function of x
because the x-value of 3 is repeated. By similar reasoning, you cannot choose p( y ) = b0 + b1 y + b2 y 2 + b3 y 3 + b4 y 4
because y = 1 corresponds to both x = 1 and x = 2.

Review Exercises for Chapter 1

2. Because the equation cannot be written in the form 6. Because the equation is in the form a1x + a2 y = b, it is
a1x + a2 y = b, it is not linear in the variables x and y. linear in the variables x and y.

4. Because the equation is in the form a1x + a2 y = b, it is 8. Choosing x2 and x3 as the free variables and letting
linear in the variables x and y. x2 = s and x3 = t , you have
3x1 + 2s − 4t = 0
3x1 = −2 s + 4t
x1 = 1
3 (−2s + 4t ).
10. Row reduce the augmented matrix for this system.
1 1 −1  1 1 −1  1 1 −1  1 0 2
          
3 2 0 0 −1 3 0 1 −3 0 1 −3
Converting back to a linear system, the solution is x = 2 and y = −3.

12. Rearrange the equations, form the augmented matrix, and row reduce.
 1 −1 3  1 −1 3  1 −1 3 1 0 7
3
       2    .
0 1 − 3 
2
4 −1 10 0 3 −2 0 1 − 3 

Converting back to a linear system, you obtain the solution x = 7 and y = − 23 .

3

14. Rearrange the equations, form the augmented matrix, and row reduce.
− 5 1 0  1 −1 0  1 −1 0  1 0 0
          
 − 1 1 0 − 5 1 0 0 − 4 0 0 1 0
Converting back to a linear system, the solution is: x = 0 and y = 0.

16. Row reduce the augmented matrix for this system. 18. Use Gauss-Jordan elimination on the augmented matrix.
40 30 24  1 1 3 3 3 3  13 4 3  1 0 −3
        
4 5 4 5 7
   
20 15 −14 20 15 −14 0 0 −26 2 3 15 0 1 7
Because the second row corresponds to the false So, the solution is: x = −3, y = 7.
statement 0 = −26, the system has no solution.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Review Exercises for Chapter 1 23

20. Multiplying both equations by 100 and forming the 36. Use Gauss-Jordan elimination on the augmented matrix.
augmented matrix produces
2 0 6 −9 1 0 0 − 3
4
20 −10 7    
 .  3 −2 11 −16  0 1 0 0 
40 −50 −1 3 −1 7 −11 0 0 1 − 5 
   4
Gauss-Jordan elimination yields the following.
So, the solution is: x = − 34 , y = 0, and z = − 54 .
 1 −1 7  1 − 1 7
2 20  2 20
   
40 −50 −1 0 −30 −15 38. Use Gauss-Jordan elimination on the augmented matrix.
1 − 1 7 1 0 3
2 5 −19 34  1 0 3 2
  2 20   5
1
 1
     
0 1 2 0 1 2  3 8 −31 54 0 1 −5 6
So, the solution is: x = 3 and y = 12 . Choosing x3 = t as the free variable, you can describe
5
the solution as x1 = 2 − 3t , x2 = 6 + 5t , and x3 = t ,
22. Because the matrix has 3 rows and 2 columns, it has size where t is any real number.
3 × 2.
40. Use Gauss-Jordan elimination on the augmented matrix.
24. This matrix corresponds to the system
1 5 0 14
3 0 1 0 0 0 0 2
− 2 x1 + 3 x2 = 0.    
0 4 2 5 3 0 0 1 0 0 0 0
Choosing x2 = t as a free variable, you can describe the 0 0 3 8 6 16  0
 0 1 0 0 4
3    
solution as x1 = 2
t and x2 = t , where t is a real 2 4 0 0 −2 0 0 0 0 1 0 −1
   
number. 2 0 −1 0 0 0 0 0 0 0 1 2

26. This matrix corresponds to the system So, the solution is: x1 = 2, x2 = 0, x3 = 4, x4 = −1,
x1 + 2 x2 + 3 x3 = 0 and x5 = 2.
0 = 1.
42. Using a graphing utility, the augmented matrix reduces to
Because the second equation is not possible, the system
has no solution.  1 0 − 0.533 0
 
0 1 1.733 0.
28. The matrix satisfies all three conditions in the definition 0 0
 0 1
of row-echelon form. Because each column that has a
leading 1 (columns 1 and 4) has zeros elsewhere, the Because 0 ≠ 1, the system has no solution.
matrix is in reduced row-echelon form.
44. Using a graphing utility, the augmented matrix reduces to
30. The matrix satisfies all three conditions in the definition
of row-echelon form. Because each column that has a 1 5 0 0
 
leading 1 (columns 2 and 3) has zeros elsewhere, the 0 0 1 0
matrix is in reduced row-echelon form. .
0 0 0 1
 
32. Use Gauss-Jordan elimination on the augmented matrix. 0 0 0 0
4 2 1 18 1 0 0 5 The system is inconsistent, so there is no solution.
   
4 − 2 − 2 28  0 1 0 2
46. Using a graphing utility, the augmented matrix reduces to
 2 − 8  
2 − 3 0 0 1 − 6
 1 0 0 1.5 0
So, the solution is: x = 5, y = 2, and z = − 6.  
0 1 0 0.5 0.
0 0 1 0.5 0
34. Use the Gauss-Jordan elimination on the augmented  
matrix. Choosing w = t as the free variable, you can describe
1 0 2 3  the solution as x = −1.5t , y = −0.5t , z = −0.5t ,
2 1 2 4 2
    w = t , where t is any real number.
2 2 0 5  0 1 − 2 1
2 −1 6 2 0 0 0 0
   
Choosing z = t as the free variable, you can describe
the solution as x = 3 − 2t , y = 1 + 2t , and z = t ,
2
where t is any real number.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
24 Chapter 1 Systems of Linear Equations

48. Use Gauss-Jordan elimination on the augmented matrix. 54. Form the augmented matrix for the system.
2 4 −7 0 1 0 3 0 2 −1 1 a
2
      
 1 −3 9 0 0 1 − 52 0  1 1 2 b
0 3 3 c
 
Letting x3 = t be the free variable, you have x1 = − 32 t ,
5 t, Use Gaussian elimination to reduce the matrix to
x2 = and x3 = t , where t is any real number.
2 row-echelon form.

50. Use Gauss-Jordan elimination on the augmented matrix.  1 1 a 

 1 1 a 1 − 2 − 
1 − 2 2 2 
2 2

1 3 5 0  1 0 37 0    
    2
 3 3 2b − a
1 9 1 1 2 b 0 
1 4 2 0 0 1 − 2 0
  2 2 2
0 3 3 c  
Choosing x3 = t as the free variable, you can describe 0 3 3 c 
the solution as x1 = − 37 t , x2 = 9 t, and x3 = t , where  1 1 a 
2 2
1 − 2 2 2 
t is any real number.  
  2b − a
52. Use Gaussian elimination on the augmented matrix. 0 1 1
3 
 
 1 −1 2 0 1 −1 2 0 0 3 3 c 
   
−1 1 −1 0  0 0 1 0  1 1 a 
0 1 − 2 
 1 k


1 0  (k + 1) −1 0 
2 2

  2b − a 
1 −1 2 0 0 1 1
3 
   
 0 (k + 1) −1 0
0 0 0 c − 2b + a
0 0 1 0
 (a) If c − 2b + a ≠ 0, then the system has no solution.
So, there will be exactly one solution (the trivial solution
(b) The system cannot have one solution.
x = y = z = 0) if and only if k ≠ −1.
(c) If c − 2b + a = 0, then the system has infinitely
many solutions

56. Find all possible first rows, where a and b are nonzero real numbers.
[0 0 0], [0 0 1], [0 1 0], [0 1 a], [1 0 0], [1 a 0], [1 a b], [1 0 a]
For each of these, examine the possible second rows.
0 0 0 0 0 1 0 1 0 0 1 0
 ,  ,  ,  ,
0 0 0 0 0 0 0 0 0 0 0 1
0 1 a 1 0 0 1 0 0 1 0 0 1 0 0
 ,  ,  ,  ,  ,
0 0 0 0 0 0 0 1 0 0 0 1 0 1 a
1 a 0 1 a 0 1 a b 1 0 a 1 0 a
 ,  ,  ,  ,  
0 0 0 0 0 1 0 0 0 0 0 0 0 1 0

58. Use Gaussian elimination on the augmented matrix.

(λ + 2) −2 3 0 1 2 λ 0 1 2 λ 0
     
 −2 (λ − 1) 6 0  0 λ + 3 6 + 2λ 0  0 λ + 3 6 + 2λ 0
 1     
 2 λ 0 0 −2λ − 6 −λ − 2λ + 3 0
2
0
 0 (λ 2
− 2λ − 15) 0

So, you need λ 2 − 2λ − 15 = (λ − 5)(λ + 3) = 0, which implies λ = 5 or λ = −3.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Review Exercises for Chapter 1 25

60. (a) True. A homogeneous system of linear equations is always consistent, because there is always a trivial solution,
i.e., when all variables are equal to zero. See Theorem 1.1 on page 21.
(b) False. Consider, for example, the following system (with three variables and two equations).
x+ y − z = 2
−2 x − 2 y + 2 z = 1.
It is easy to see that this system has no solution.

62. From the following chart, you obtain a system of 66. (a) Because there are four points, choose a third-degree
equations. polynomial, p( x) = a0 + a1x + a2 x 2 + a3 x3.
A B C By substituting the values at each point into this
1 2 2
equation, you obtain the system
Mixture X 5 5 5 a0 − a1 + a2 − a3 = −1
Mixture Y 0 0 1 a0 = 0
Mixture Z
1 1 1 a0 + a1 + a2 + a3 = 1
3 3 3
6 8 13 a0 + 2a1 + 4a2 + 8a3 = 4.
Desired Mixture 27 27 27
Use Gauss-Jordan elimination on the augmented
1x 6  matrix.
5
+ 13 z = 27  10 12
2x 1z 8
x = 27
, z = 27 1 −1 1 −1 −1 1 0 0 0 0
+ = 27 
  
5 3   1 0 0 23 
1 0 0 0 0 0
2x + y + 13 z = 13
 y = 5  
5 27 27 1 1 1 1 1  0 0 1 0 0
   
To obtain the desired mixture, use 10 gallons of 1 2 4 8 4 0 0 0 1 13 
spray X, 5 gallons of spray Y, and 12 gallons of spray Z.
So, p( x) = 2x
3
+ 13 x3.
3x 2 + 3x − 2 A B C y
64. = + + (b)
(x + 1) ( x − 1) x + 1 x − 1 ( x + 1)2
2

4 (2, 4)
3x 2 + 3 x − 2 = A( x + 1)( x − 1) + B( x + 1) + C ( x − 1)
2
3
3x 2 + 3 x − 2 = Ax 2 − A + Bx 2 + 2 Bx + B + Cx − C 2

3x 2 + 3x − 2 = ( A + B) x 2 + ( 2 B + C ) x − A + B − C 1 (1, 1)
x
So, A + B = 3 (−1, −1) (0, 0) 2 3
2B + C = 3
−A + B − C = −2. 68. Substituting the points, (1, 0), (2, 0), (3, 0), and (4, 0)
Use Gauss-Jordan elimination to solve the system. into the polynomial p( x) yields the system
 1 1 0 3  1 0 0 2 a0 + a1 + a2 + a3 = 0
   
 0 2 1 3  0 1 0 1 a0 + 2a1 + 4a2 + 8a3 = 0
−1 1 −1 −2 0 0 1 1
    a0 + 3a1 + 9a2 + 27 a3 = 0
The solution is: A = 2, B = 1, and C = 1. a0 + 4a1 + 16a2 + 64a3 = 0.
2
3x + 3x − 2 2 1 1 Gaussian elimination shows that the only solution is
So, = + + .
(x + 1) ( x − 1) x + 1 x − 1 ( x + 1)2
2
a0 = a1 = a2 = a3 = 0.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
26 Chapter 1 Systems of Linear Equations

(0) + v0 (0) + s0 = 160 

1 2
70. (a) When t = 0, s = 160: 2
a s0 = 160
(1) + v0 (1) + s0 = 96 
2 1a
When t = 1, s = 96: 1
a 2
+ v0 + s0 = 96
2

(2) + v0 ( 2) + s0 = 0  2a + 2v0 + s0 = 0
1 2
When t = 2, s = 0: 2
a
Use Gaussian elimination to solve the system.
s0 = 160
1
2
a + v0 + s0 = 96
2a + 2v0 + s0 = 0
a + 2v0 + 2 s0 = 192
2a + 2v0 + s0 = 0
s0 = 160
a + 2v0 + 2 s0 = 192
− 2v0 − 3s0 = − 384 (− 2) Eq. 1 + Eq. 2
s0 = 160
a + 2v0 + 2 s0 = 192
v0 + 3
s
2 0
= 192 (− 12 ) Eq. 2
s0 = 160
s0 = 160  s0 = 160
v0 + 3
2(160) = 192  v0 = − 48
a + 2( − 48) + 2(160) = 192  a = − 32

The position equation is s = 1

2 (− 32)t 2 − 48t + 160, or s = −16t 2 − 48t + 160.

(b) When t = 1, s = 134: 12 a(1) + v0 (1) + s0 = 134  a + 2v0 + 2s0 = 268

2

When t = 2, s = 86: 12 a( 2) + v0 ( 2) + s0 = 86  2a + 2v0 + s0 = 86

2

When t = 3, s = 6: 12 a(3) + v0 (3) + s0 = 6  9a + 6v0 + 2s0 = 12

2

Use Gaussian elimination to solve the system.

a + 2v0 + 2 s0 = 268
2a + 2v0 + s0 = 86
9a + 6v0 + 2s0 = 12
a + 2v0 + 2 s0 = 268
− 2v0 − 3s0 = −450 (−2)Eq.1 + Eq.2
−12v0 − 16 s0 = −2400 (−9)Eq.1 + Eq.3
a + 2v0 + 2 s0 = 268
− 2v0 − 3s0 = −450
3v0 + 4 s0 = 600 (− 14 )Eq.3
a + 2v0 + 2s0 = 268
− 2v0 − 3s0 = −450
− s0 = −150 3Eq.2 + 2Eq.3
− s0 = −150  s0 = 150
−2v0 − 3(150) = −450  v0 = 0
a + 2(0) + 2(150) = 268  a = −32

The position equation is s = 1

2 (−32)t 2 + (0)t + 150, or s = −16t 2 + 150.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 Project Solutions for Chapter 1 27

(1) + v0 (1) + s0 = 134  a + 2v0 + 2s0 = 368

1 2
(c) When t = 1, s = 184: 2
a
( 2) + v0 ( 2) + s0 = 116  2a + 2v0 + s0 = 116
1 2
When t = 2, s = 116: 2
a
(3) + v0 (3) + s0 = 16  9a + 6v0 + 2s0 = 32
1 2
When t = 3, s = 16: 2
a

Use Gaussian elimination to solve the system.

a + 2v0 + 2 s0 = 368
2a + 2v0 + s0 = 116
9a + 6v0 + 2 s0 = 32

a + 2v0 + 2 s0 = 368
− 2v0 − 3s0 = − 620 (− 2) Eq. 1 + Eq. 2
− 12v0 − 16 s0 = − 3280 (− 9) Eq. 1 + Eq. 3
a + 2v0 + 2 s0 = 368
v0 + 3
s
2 0
= 310 (− 12 ) Eq. 2
− 12v0 − 16 s0 = − 3280

a + 2v0 + 2 s0 = 368
3
v0 + s
2 0
= 310
2 s0 = 440 12 Eq. 2 + Eq. 3

2 s0 = 440  s0 = 220
− 2v0 − 3( 220) = − 620  v0 = − 20
a + 2( − 20) + 2( 220) = 368  a = − 32

The position equation is s = − 12 ( − 32)t 2 + ( − 20)t + 220, or s = −16t 2 − 20t + 220.

72. Applying Kirchoff’s first law to either junction produces

I1 + I 3 = I 2 and applying the second law to the two paths produces
R1I1 + R2 I 2 = 3I1 + 4 I 2 = 3
R2 I 2 + R3 I 3 = 4 I 2 + 2 I 3 = 2.
Rearrange these equations, form the augmented matrix, and use Gauss-Jordan elimination.
 1 −1 1 0 1 0 0 5
13
   6

3 4 0 3  0 1 0 13 
0 4 2 2 0 0 1 1
   13 

So, the solution is I1 = 5, I2 = 6, and I 3 = 1.

13 13 13

Project Solutions for Chapter 1

1 Graphing Linear Equations

2 −1 3 1 − 12 3 
2
1.     1a 6 − 3a

a b 6 0 b + 2 
2 

(a) Unique solution if b + 12 a ≠ 0. For instance, a = b = 2.

(b) Infinite number of solutions if b + 12 a = 6 − 32 a = 0  a = 4 and b = −2.

(c) No solution if b + 12 a = 0 and 6 − 32 a ≠ 0  a ≠ 4 and b = − 12 a. For instance, a = 2, b = −1.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
28 Chapter 1 Systems of Linear Equations

y y
(d) 2x + 2y = 6 y 2x − y = 3 2x − y = 3
4 1
3 3 x
2 2 −2
1 1 −2
x x −3
−4 −2 2 3 −4 −2 2 3 4 2x − y = 3
−2 −2 2x − y = 6
−3 −3

(a) 2 x − y = 3 (b) 2 x − y = 3 (c) 2 x − y = 3

2x + 2 y = 6 4x − 2 y = 6 2x − y = 6
(The answers are not unique.)

2. (a) x + y + z = 0 (b) x + y + z = 0 (c) x + y + z = 0

x + y + z = 0 y + z =1 x + y + z = 1
x− y − z = 0 z = 2 x− y − z = 0
(The answers are not unique.)
There are other configurations, such as three mutually parallel planes or three planes that intersect pairwise in lines.

2 Underdetermined and Overdetermined Systems of Equations

1. Yes, x + y = 2 is a consistent underdetermined system. 5. In general, a linear system with more equations than
variables would probably be inconsistent. Here is an
2. Yes, intuitive reason: Each variable represents a degree of
x+ y = 2 freedom, while each equation gives a condition that in
general reduces number of degrees of freedom by one.
2x + 2 y = 4 If there are more equations (conditions) than variables
3x + 3 y = 6 (degrees of freedom), then there are too many conditions
for the system to be consistent. So you expect such a
is a consistent, overdetermined system.
system to be inconsistent in general. But, as Exercise 2
3. Yes, shows, this is not always true.
x + y + z = 1 6. In general, a linear system with more variables than
x + y + z = 2 equations would probably be consistent. As in Exercise 5,
the intuitive explanation is as follows. Each variable
is an inconsistent underdetermined system.
represents a degree of freedom, and each equation
4. Yes, represents a condition that takes away one degree of
freedom. If there are more variables than equations, in
x + y =1 general, you would expect a solution. But, as Exercise 3
x + y = 2 shows, this is not always true.
x + y = 3
is an inconsistent underdetermined system.

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
 C H A P T E R 2
Matrices

Section 2.1 Operations with Matrices .....................................................................30

Section 2.2 Properties of Matrix Operations...........................................................36

Section 2.3 The Inverse of a Matrix ........................................................................ 41

Section 2.4 Elementary Matrices.............................................................................46

Section 2.5 Markov Chains .....................................................................................53

Section 2.6 More Applications of Matrix Operations ............................................62

Review Exercises ..........................................................................................................66

Project Solutions...........................................................................................................75

© 2017 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.