Finite Mathematics & Its 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
2
1. Right 2, up 3 y
y
(2, 3)
x
x
( )
–1, – 52
7. Left 20, up 40
2. Left 1, up 4 y
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 Q is 2 units to the left and 2 units up or
4. Right 2
y (—2, 2).
10. Point P is 3 units to the right 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. Left 2, up 1 1
y 12. —2(2) + (6) = —1 is false, so no the point is not
3
on the line
(–2, 1)
x
Copyright © 2023 Pearson Education, Inc. 1-1
, Chapter 1: Linear Equations and Straight Lines ISM: Finite Math
1 24. i 0 i= i5
13 —2x + y = —1 Substitute i the i x i and i y no isolution
3
. x-intercept: inone
coordinates iof ithe ipoint iinto ithe iequation:
f 1 i hıi f h iWhen ix i= i0, iy i=
' ,i3 → i—2 ' 1 ı + i1 i(3)=i i—1 i→ i—1+1 i=i—1 i is i5iy-intercept: i(0,
y' ı ' ı
i5)
2 i i iJ yi2J 3
a ifalse istatement. iSo ino ithe ipoint iis inot 25. iWhen iy i= i0, ix i=
ion itheiline. i7 ix-intercept: i(7,
i0)i0 i= i7
f 1h f1 h
14 —2 ' ı + ' ı (—1) i=i—1 i is itrue iso iyes ithe ipoint iis no isolution
.
'y3 ıJ i i i'y3 ıJ y-intercept: inone
on ithe iline. 26. i 0 i= i–8x
15. i m i= i5, ib i= i8 x i= i0
x-intercept: i(0, i0)
16. i m i= i–2 iand ib i= i–6 y i= i–8(0)
y i= i0
17. i y i= i0x i+ i3; im i= i0, ib y-intercept: i(0, i0)
i= i3
2i 2i 1i
y i= i x i+i0; i m i= i , i b i= i0 27 0 i= i x i– i1
18 3
3 3 .
. x i= i3
19. i 14x i+i7 iy i= i21 x-intercept: i(3, i0)
1i
7 iy i= i—14x i+ i21 y i = i (0) i– i1
3
y i = i—2x i+i3
y i= i–1
y-intercept: i(0, i–1)
20 x i— iy i = i3 y
. —y i = i—x i+i3
y i = ix i—i3
(3, 0)
21. i i i 3x i= i5 x
5 (0, –1)
x i= i
3
1 2
28. When ix i= i0, iy i= i0.
22 – x i+ y i =i10
. 2 3 When ix i= i1, iy i= i2.
2i 1i y
y i= i x i+10
3 2
3i
y i = i x i+15 (1, 2)
4 x
(0, 0)
23. 0 i= i—4x i+i8
4x i = i8
x i= i2
x-intercept: i(2, i0)
y i= i–4(0) i+ i8
y i= i8
1-2 Copyright © 2023 Pearson Education, Inc.