-- -- -- -- -- --
Applications 13th Edition by Larry J.
-- -- -- -- --
Goldstein, Chapters 1 - 12, Complete
-- -- -- -- --
, Contents
Chapter 1: Linear Equations and Straight Lines
-- -- -- -- -- 1–1
Chapter 2: Matrices
-- 2–1
Chapter 3: Linear Programming, A Geometric Approach
-- -- -- -- -- 3–1
Chapter 4: The Simplex Method
-- -- -- 4–1
Chapter 5: Sets and Counting
-- -- -- 5–1
Chapter 6: Probability
-- 6–1
Chapter 7: Probability and Statistics
-- -- -- 7–1
Chapter 8: Markov Processes
-- -- 8–1
Chapter 9: The Theory of Games
-- -- -- -- 9–1
Chapter 10: The Mathematics of Finance
-- -- -- -- 10–1
Chapter 11: Logic
-- 11–1
Chapter 12: Difference Equations and Mathematical Models
-- -- -- -- -- 12–1
, Chapter 1 --
Exercises--1.1 5
6. Left- - 1,- - down--
1. 2
Right- - 2,- - up- - 3 y
y
(2, 3)
x
x
2
7. Leftj--20,- - up- - 40
2. Leftj--1,- - up y
4
y
(–20, 40)
(–1, 4)
x
x
8. Right- - 25,- - up- - 30
3. Down- - 2 y
y
(25, 30)
x
x
(0, –2)
9. Point- - Qj--is--2- - units- - to- - the- - left- - and- - 2- - units--
4. Right- - 2
y up- - or--(—2,--2).
10. Point- - P- - is--3- - units- - to- - the- - rightj--and- - 2- - units--
down- - or--(3,—2).
x
(2, 0) 1--
11. —2(1)- - (3)--=--—2--+1--=--—1so- - yes- - the- - point- - is
+ 3
on- - the- -
line.
5. Leftj--2,- - up
12. 1
1 —2(2)--+- - - - (6)- - =j—1--is- - false,- - so- - no- - the- - point- - is- - not
y
3
on- - the- -
(–2, 1) line
x
Copyright--©--2023--Pearson--Education,--Inc. 1-1
, Chapter--1:--Linear--Equations--and--Straight--Lines ISM:--Finite--Math
1 24.- - 0- - =- - 5
13 —2x-- y- - =j—1- - Substitute- - the- - x- - no- - solution
+ and- - y--3 x-intercept:
.
coordinates-- ofj--the- - point- - into- - the- - none- - When- - x- - =
equation:
f1- - - - ıh f1ıh- - 1
'- - ,3-- →—2' +- - (3)=—1→—1+1=—1- - is
0,- - y- - =- - 5y-
y' I ' ı intercept:- - (0,- - 5)
2 J y2J 3
a- - false- - statement.- - So- - no- - the- - point- - is- - 25.- - When- - yj--=- - 0,- - xj-
not--on- - theline. -=j- - 7--x-intercept:-
- (7,
f-1h f-1- h 0)0- - =- - 7
14 —2 ' ı +'- -ı- - (—1)--=—1- - is- - true- - so- - yes- - the- - no- - solution
.
point- - is
y-intercept:--none
y 3 J y'3ıJ
' ı
on- - the- - line. 26.- - 0- - =- - –8x
15. m- - =- - 5,- - b- - =- - 8 x- - =- - 0
x-intercept:- - (0,- - 0)
16. m- - =- - –2- - and- - b- - =- - –6 yj--=- - –8(0)
yj--=- - 0
17. y- - =j--0x- - +- - 3;- - m- - =- - y-intercept:- - (0,- - 0)
0,- - b
=- - 3
2 2 1- -
27 0-- =- - x- - –--1
18 yj--= x--+0;- - m- - = ,- - b- - =-- 3
0 .
. 3 3 xj--=- - 3
19.- - - - 14x--+7-yj--=--21 x-intercept:- - (3,-- 0)
1--
7--yj--=j—14x--+21 y- - =- - (0)- - –--1
3
y- - =--—2x--+3
y- - =- - –1
y-intercept:- - (0,-- –1)
20 x--—--y- - =--3 y
. —yj--=j—xj-+3
y--=--xj—3
(3, 0)
21. 3x- - =--5 x
5 (0, –1)
x- - =--
3
1 2 28.- - When- - x- - =- - 0,- - yj--=- - 0.
22 –-- --x-- 3 --yj- - =10 When- - x- - =- - 1,- - yj--=- - 2.
+ 2 2- - 1- -
. y
y- - =- - xj-
+10
3 2 (1, 2)
3- -
yj--=- - xj- (0, 0) x
+15
4
23. 0j--=j—4x- - +8
1-2
4x- - =--8
xj--=--2
x-intercept:- - (2,- -
0)
yj--=- - –4(0)- - +- - 8
yj--=- - 8